Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms

12/18/2018
by   Gábor Elek, et al.
0

The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and local-global graph limit theories for sparse graphs. The natural limit objects are continuous actions of finitely generated groups on totally disconnected compact metric spaces. We prove that the space of weak equivalent classes of free Cantor actions is compact and contains a smallest element, as in the measurable case. We will introduce and study various notions of almost finiteness, the qualitative analogue of hyperfiniteness, for classes of bounded degree graphs. We prove the almost finiteness of a new class of étale groupoids associated to Cantor actions and construct an example of a nonamenable, almost finite totally disconnected étale groupoid, answering a query of Suzuki. Motivated by the notions and results on qualitative graph limits, in the second part of our paper we give a precise definition of constant-time distributed algorithms on sparse graphs. We construct such constant-time algorithms for various approximation problems for hyperfinite and almost finite graph classes. We also prove the Hausdorff convergence of the spectra of convergent graph sequences in the strongly almost finite category.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2023

Limits, approximation and size transferability for GNNs on sparse graphs via graphops

Can graph neural networks generalize to graphs that are different from t...
research
01/22/2020

Bibliography of distributed approximation on structurally sparse graph classes

This document is an informal bibliography of the papers dealing with dis...
research
07/21/2003

Limit groups and groups acting freely on ^n-trees

We give a simple proof of the finite presentation of Sela's limit groups...
research
07/28/2020

Injective hulls of various graph classes

A graph is Helly if its disks satisfy the Helly property, i.e., every fa...
research
03/06/2018

Induced and Weak Induced Arboricities

We define the induced arboricity of a graph G, denoted by ia(G), as the...
research
02/14/2023

Graph subshifts

We propose a definition of graph subshifts of finite type that can be se...
research
08/27/2019

Learning Very Large Graphs and Nonsingular Actions of Discrete Groups

Recently, Goldreich introduced the notion of property testing of bounded...

Please sign up or login with your details

Forgot password? Click here to reset