License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.35
URN: urn:nbn:de:0030-drops-66588
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6658/
Go to the corresponding LIPIcs Volume Portal

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

Estimating Parameters Associated with Monotone Properties

pdf-format:
LIPIcs-APPROX-RANDOM-2016-35.pdf (0.6 MB)

Abstract

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 epsilon 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.

BibTeX - Entry

@InProceedings{hoppen_et_al:LIPIcs:2016:6658,
  author =	{Carlos Hoppen and Yoshiharu Kohayakawa and Richard Lang and Hanno Lefmann and Henrique Stagni},
  title =	{{Estimating Parameters Associated with Monotone Properties}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{35:1--35:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6658},
  URN =		{urn:nbn:de:0030-drops-66588},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.35},
  annote =	{Keywords: parameter estimation, parameter testing, edit distance to monotone graph properties, entropy of subgraph classes, speed of subgraph classes}
}

Keywords: parameter estimation, parameter testing, edit distance to monotone graph properties, entropy of subgraph classes, speed of subgraph classes
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Issue Date: 2016
Date of publication: 06.09.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI