One-ended spanning trees in amenable unimodular graphs

DOI10.1214/19-ECP274MaRDI QIDQ2279087zbMATH OpenFDO

Authors Á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, https://projecteuclid.org/euclid.ecp/1573528177

zbMATH Keywords

factor of iidinvariant spanning treeone-endedunimodular random graph

Mathematics Subject Classification ID

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

Abstract: We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is almost surely a spanning tree of one end. In [2] and [1] similar claims were proved, but the resulting spanning tree had 1 or 2 ends, and one had no control of which of these two options would be the case.

Review text

A unimodular random graph is a probability measure on a collection of locally finite graphs with a special vertex considered as their root, where the mass transport principle holds. That is, the expected mass that is sent out of the roots is equal to the total mass that is received by the root. A subgraph \(H\) of a rooted graph \((G,\ast)\) is called a factor of iid (abbreviated as fiid), if it can be constructed as a measurable function from iid uniformly distributed random labels of \(V(G)\) which belong to \([0,1]\). The main result of this paper is the almost sure existence of a factor of iid spanning trees with one end in a unimodular random graph that is amenable and ergodic and has one end. A characterisation of amenability in relation to fiids is that a unimodular random graph \(G\) is amenable if and only if it contains a factor of iid subgraphs \(\Gamma_n\), with finite components almost surely, whose union is \(G\). The main theorem gives also a characterisation of the amenability of a quasi-transitive unimodular amenable graph with one end as having an invariant spanning tree with one end.

Recommendations

• Invariant spanning double rays in amenable groups
• Ends in uniform spanning forests
• Uniform spanning forests
• Spanning trees of locally finite graphs
• Ends in free minimal spanning forests

Cites work

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

Cited in

(10)

• A nonamenable ``factor of a Euclidean space
• Invariant embeddings of unimodular random planar graphs
• Counter examples to invariant circle packing
• Invariant spanning double rays in amenable groups
• Invariant tilings and unimodular decorations of Cayley graphs
• Factor-of-iid balanced orientation of non-amenable graphs
• Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
• One-ended spanning trees and definable combinatorics
• Unimodular random one-ended planar graphs are sofic
• The number of ends in the uniform spanning tree for recurrent unimodular random graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279087)