Insertion-tolerance and repetitiveness of random graphs
Dynamical Systems
2016-05-10 v2
Abstract
Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular laws as a corollary of a general lemma about countable Borel equivalence relations on first countable Hausdorff spaces.
Keywords
Cite
@article{arxiv.1604.05541,
title = {Insertion-tolerance and repetitiveness of random graphs},
author = {Fernando Alcalde Cuesta and Álvaro Lozano Rojo and Antón C. Vázquez Martínez},
journal= {arXiv preprint arXiv:1604.05541},
year = {2016}
}
Comments
To appear in Stochastics and Dynamics