Estimating parameters associated with monotone properties

DOI10.4230/LIPICS.APPROX-RANDOM.2016.35MaRDI QIDQ4636468zbMATH OpenOpenAlexWikidataFDO

Authors Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1707.08225

zbMATH Keywords

edit distance to monotone graph propertiesentropy of subgraph classesparameter estimationparameter testingspeed of subgraph classes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Abstract: There 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 $q_z=q_z(epsilon)$ 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 $epsilon$ with probability at least 2/3. In this paper, for any fixed monotone graph property $mathcalP=mboxForb(mathcalF)$, we study the sample complexity of estimating a bounded graph parameter $z_{mathcalP}$ that, for an input graph $G$, counts the number of spanning subgraphs of $G$ that satisfy $mathcalP$. To improve upon previous upper bounds on the sample complexity, we show that the vertex set of any graph that satisfies a monotone property $mathcalP$ 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 $mathcalP$. Properties for which this holds are said to be recoverable, and the study of recoverable properties may be of independent interest.

Recommendations

• Estimating parameters associated with monotone properties
• Every monotone graph property is testable
• Every Monotone Graph Property Is Testable
• Testing versus Estimation of Graph Properties
• Property testing and its connection to learning and approximation

Cited in

(6)

• Estimating the distance to a hereditary graph property
• Estimating the number of connected components in a graph via subgraph sampling
• On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
• Estimating parameters associated with monotone properties
• Lower bounds for approximating graph parameters via communication complexity
• Earthmover Resilience and Testing in Ordered Structures

This page was built for publication: Estimating parameters associated with monotone properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636468)