Testing permutation properties through subpermutations


Autoria(s): HOPPEN, Carlos; KOHAYAKAWA, Yoshiharu; MOREIRA, Carlos Gustavo; SAMPAIO, Rudini Menezes
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

20/10/2012

20/10/2012

2011

Resumo

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 Lovasz, V.T. Sos, 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. (C) 2011 Elsevier B.V. All rights reserved.

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

CNPq[484154/2010-9]

CNPq[308509/2007-2]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul (FAPERGS)

FAPERGS[10/0388-2]

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

FAPESP[2007/56496-3]

Funcap

Funcap[07.013.00/09]

Identificador

THEORETICAL COMPUTER SCIENCE, v.412, n.29, p.3555-3567, 2011

0304-3975

http://producao.usp.br/handle/BDPI/30367

10.1016/j.tcs.2011.03.002

http://dx.doi.org/10.1016/j.tcs.2011.03.002

Idioma(s)

eng

Publicador

ELSEVIER SCIENCE BV

Relação

Theoretical Computer Science

Direitos

restrictedAccess

Copyright ELSEVIER SCIENCE BV

Palavras-Chave #Property testing #Parameter testing #Permutations #GRAPH PROPERTIES #SEQUENCES #NUMBER #Computer Science, Theory & Methods
Tipo

article

original article

publishedVersion