Testing permutation properties through subpermutations

详细信息    查看全文

• 作者：Carlos Hoppen^a ; ^{choppen@ufrgs.br"" rel=""nofollow} ; ^{carhoppen@yahoo.com"" rel=""nofollow} ; Yoshiharu Kohayakawa^b ; ^{yoshi@ime.usp.br"" rel=""nofollow} ; Carlos Gustavo Moreira^c ; ^{gugu@impa.br"" rel=""nofollow} ; Rudini Menezes Sampaio^d ; ^{rudini@ufc.br"" rel=""nofollow}
• 关键词：Property testing ; Parameter testing ; Permutations
• 刊名：Theoretical Computer Science
• 出版年：2011
• 出版时间：1 July 2011
• 年：2011
• 卷：412
• 期：29
• 页码：3555-3567
• 全文大小：306 K

文摘

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L. Lovász, V.T. Sós, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261–270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703–1727.] stating that every hereditary graph property is testable.