Graph Hausdorff dimension, Kolmogorov complexity and construction of fractal graphs

Graph Theory Seminar
Thursday, October 13, 2016 - 13:30
1 hour (actually 50 minutes)
Skiles 005
Department of Computer Science, Georgia State University
Lately there was a growing interest in studying self-similarity and fractal properties of graphs, which is largely inspired by applications in biology, sociology and chemistry. Such studies often employ statistical physics methods that borrow some ideas from graph theory and general topology, but are not intended to approach the problems under consideration in a rigorous mathematical way. To the best of our knowledge, a rigorous combinatorial theory that defines and studies graph-theoretical analogues of topological fractals still has not been developed. 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 Nesetril-Rodl) dimension. It allowed 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 discover 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.