图的豪斯多夫维数、Kolmogorov复杂度与分形图的构造
Graph Hausdorff dimension, Kolmogorov complexity and construction of fractal graphs
摘要:
本文引入并研究了图的Lebesgue维数和豪斯多夫维数的离散类似。事实证明,它们与著名的图特征密切相关,如秩维数和布拉格(或Nešetzil-Rödl)维数。它允许我们形式化地定义分形图,并建立一些图类的分形性。我们展示了图的豪斯多夫维数与其Kolmogorov复杂度之间的关系。我们还证明了这种跨学科的方法,发现了一种新的属性一般紧凑的度量空间,使用超图理论的思想,并证明了布拉格维的估计,几乎所有的图使用算法信息论的方法。
英文摘要:
In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or Nešetřil-Rödl) dimension. It allows us to formally define fractal graphs and establish fractality of some graph classes. We show, how Hausdorff dimension of graphs is related to their Kolmogorov complexity. We also demonstrate fruitfulness of this interdisciplinary approach by discovering a novel property of general compact metric spaces using ideas from hypergraphs theory and by proving an estimation for Prague dimension of almost all graphs using methods from algorithmic information theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。