One-ended spanning trees in amenable unimodular graphs

DOI10.1214/19-ECP274zbMath1457.60020arXiv1805.10690MaRDI QIDQ2279087

Ádám Timár

Publication date: 12 December 2019

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

unimodular random graphfactor of iidinvariant spanning treeone-ended

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (6)

Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. ⋮ Invariant spanning double rays in amenable groups ⋮ A nonamenable ``factor of a Euclidean space ⋮ Invariant embeddings of unimodular random planar graphs ⋮ Invariant tilings and unimodular decorations of Cayley graphs ⋮ Counter examples to invariant circle packing

Cites Work

• Unnamed Item
• Group-invariant percolation on graphs
• Tree and grid factors for general point processes
• Topics in orbit equivalence
• A nonamenable ``factor of a Euclidean space
• Processes on unimodular random networks
• An amenable equivalence relation is generated by a single transformation
• Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
• Amenability, hyperfiniteness, and isoperimetric inequalities

This page was built for publication: One-ended spanning trees in amenable unimodular graphs