Author:
Hoppen Carlos,Kohayakawa Yoshiharu,Lang Richard,Lefmann Hanno,Stagni Henrique
Abstract
AbstractThere has been substantial interest in estimating the value of a graph parameter, i.e. of a real-valued function defined on the set of finite graphs, by querying a randomly sampled 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 qz = qz(ε) of an estimable parameter z is the size of a random sample of a graph G required to ensure that the value of z(G) may be estimated within an error of ε with probability at least 2/3. In this paper, for any fixed monotone graph property $\mathcal{P}= \text{Forb}\!(\mathcal{F}),$ we study the sample complexity of estimating a bounded graph parameter z that, for an input graph G, counts the number of spanning subgraphs of G that satisfy$\mathcal{P}$. To improve upon previous upper bounds on the sample complexity, we show that the vertex set of any graph that satisfies a monotone property $\mathcal{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 $\mathcal{P}$. Properties for which this holds are said to be recoverable, and the study of recoverable properties may be of independent interest.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference38 articles.
1. Three theorems regarding testing graph properties
2. The number of graphs without forbidden subgraphs
3. A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
4. [16] Erdős, P. , Kleitman, D. J. and Rothschild, B. L. (1976) Asymptotic enumeration of Kn -free graphs. In Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Vol. II, Accademia Nazionale dei Lincei, Rome, pp. 19–27.
5. [10] Bollobás, B. (1998) Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring. Documenta Math. Extra Vol. ICM III 333–342.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献