| Texto completo | |
| Autor(es): |
Hoppen, Carlos
;
Kohayakawa, Yoshiharu
;
Lang, Richard
;
Lefmann, Hanno
;
Stagni, Henrique
Número total de Autores: 5
|
| Tipo de documento: | Artigo Científico |
| Fonte: | APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016; v. 60, p. 13-pg., 2016-01-01. |
| Resumo | |
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real function defined on the set of finite graphs, by sampling a randomly chosen substructure whose size is independent of the size of the input. Graph parameters that may be successfully estimated in this way are said to be testable or estimable, and the sample complexity q(z) = q(z) (epsilon) of an estimable parameter z is the size of the random sample required to ensure that the value of z(G) may be estimated within error " with probability at least 2/3. In this paper, we study the sample complexity of estimating two graph parameters associated with a monotone graph property, improving previously known results. To obtain our results, we prove that the vertex set of any graph that satisfies a monotone property P may be partitioned equitably into a constant number of classes in such a way that the cluster graph induced by the partition is not far from satisfying a natural weighted graph generalization of P. Properties for which this holds are said to be recoverable, and the study of recoverable properties may be of independent interest. (AU) | |
| Processo FAPESP: | 15/15986-4 - Combinatória Assintótica com Aplicações em Teste de Propriedades e Estimação de Parâmetros. |
| Beneficiário: | Henrique Stagni |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |
| Processo FAPESP: | 13/07699-0 - Centro de Pesquisa, Inovação e Difusão em Neuromatemática - NeuroMat |
| Beneficiário: | Oswaldo Baffa Filho |
| Modalidade de apoio: | Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs |
| Processo FAPESP: | 13/03447-6 - Estruturas combinatórias, otimização e algoritmos em Teoria da Computação |
| Beneficiário: | Carlos Eduardo Ferreira |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |