Insertion-tolerance and repetitiveness of random graphs

DOI10.1142/S021949371750023XzbMath1359.05106arXiv1604.05541OpenAlexW2962696615MaRDI QIDQ2977589

Álvaroo Lozan Rojo, Antón Carlos Vázquez Martínez, Fernando Alcalde Cuesta

Publication date: 18 April 2017

Published in: Stochastics and Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05541

zbMATH Keywords

random graphsBorel equivalence relationsprobability measures

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20)

Cites Work

• Unnamed Item
• A measurable-group-theoretic solution to von Neumann's problem
• Indistinguishability of percolation clusters
• Recurrence of distributional limits of finite planar graphs
• Processes on unimodular random networks
• Invariant percolation and harmonic Dirichlet functions
• Dynamique transverse de la lamination de Ghys-Kenyon
• Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure

This page was built for publication: Insertion-tolerance and repetitiveness of random graphs