pith. sign in

arxiv: 1604.05541 · v2 · pith:WEFWCTN6new · submitted 2016-04-19 · 🧮 math.DS

Insertion-tolerance and repetitiveness of random graphs

classification 🧮 math.DS
keywords graphscayleycountableexamplesrandomarisebondborel
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.