首页    期刊浏览 2025年02月19日 星期三
登录注册

文章基本信息

  • 标题:Estimating Parameters Associated with Monotone Properties
  • 本地全文:下载
  • 作者:Carlos Hoppen ; Yoshiharu Kohayakawa ; Richard Lang
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2016
  • 卷号:60
  • 页码:35:1-35:13
  • DOI:10.4230/LIPIcs.APPROX-RANDOM.2016.35
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:parameter estimation; parameter testing; edit distance to monotone graph properties; entropy of subgraph classes; speed of subgraph classes
国家哲学社会科学文献中心版权所有