×

zbMATH — the first resource for mathematics

One-ended spanning trees in amenable unimodular graphs. (English) Zbl 1457.60020
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.

MSC:
60C05 Combinatorial probability
05C80 Random graphs (graph-theoretic aspects)
PDF BibTeX XML Cite
Full Text: DOI Euclid
References:
[1] Aldous, D., Lyons, R. (2007) Processes on unimodular random networks Electron. J. Probab. 12, 1454-1508. · Zbl 1131.60003
[2] Benjamini, I., Lyons, R., Peres, Y., Schramm, O. (1999) Group-invariant percolation on graphs Geom. Funct. Anal. 9, 29-66. · Zbl 0924.43002
[3] Connes, A., Feldman, J., and Weiss, B. (1981) An amenable equivalence relation is generated by a single transformation, Ergodic Theory Dynamical Systems 1, 431-450. · Zbl 0491.28018
[4] Feldman, J., and Moore, C. (1977) Ergodic equivalence relations, cohomology, and von Neumann algebras I. Trans. Amer. Math. Soc., 234 (2), 289-324. · Zbl 0369.22009
[5] Kaimanovich, V.A. (1997) Amenability, hyperfiniteness, and isoperimetric inequalities. C. R. Acad. Sci. Paris Sér. I Math. 325, 999-1004. · Zbl 0981.28014
[6] Kechris, A.S. and Miller, B.D. (2004) Topics in Orbit Equivalence, volume 1852 of Lecture Notes in Mathematics, Springer-Verlag, Berlin. · Zbl 1058.37003
[7] Lovász, L. (2012) Large Networks and Graph Limits, volume 60 of Colloquium Publications, Amer. Math. Soc., Providence, RI.
[8] Timár, Á. (2004) Tree and grid factors of general point processes, Electronic Communications in Probability 9, 53-59.
[9] Timár, Á. (2017) A nonamenable “factor” of a euclidean space, preprint, arXiv:1712.08210.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.