Shift-coupling of random rooted graphs and networks

DOI10.1090/CONM/719/14474MaRDI QIDQ5236809zbMATHOpenAlexFDO

Authors Ali Khezeli

Publication date 16 October 2019

Published in Unimodularity in Randomly Generated Graphs (Search for Journal in Brave)

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

zbMATH Keywords

random graphsunimodularityrandom networksshift-couplinginvariant transportsnetwork extensionstable transportsunimodularization

Mathematics Subject Classification ID

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

Abstract: In this paper, we present a result similar to the shift-coupling result of Thorisson (1996) in the context of random graphs and networks. The result is that a given random rooted network can be obtained by changing the root of another given one if and only if the distributions of the two agree on the invariant sigma-field. Several applications of the result are presented for the case of unimodular networks. In particular, it is shown that the distribution of a unimodular network is uniquely determined by its restriction to the invariant sigma-filed. Also, the theorem is applied to the existence of an invariant transport kernel that balances between two given (discrete) measures on the vertices. An application is the existence of a so called extra head scheme for the Bernoulli process on an infinite unimodular graph. Moreover, a construction is presented for balancing transport kernels that is a generalization of the Gale-Shapley stable matching algorithm in bipartite graphs. Another application is on a general method that covers the situations where some vertices and edges are added to a unimodular network and then, to make it unimodular, the probability measure is biased and then a new root is selected. It is proved that this method provides all possible unimodularizations in these situations. Finally, analogous existing results for stationary point processes and unimodular networks are discussed in detail.

Recommendations

• Invariance, quasi-invariance, and unimodularity for random graphs
• Extra heads and invariant allocations
• Processes on unimodular random networks
• Invariant Schreier decorations of unimodular random networks
• Strong couplings for static locally tree-like random graphs

Cites work

• scientific article; zbMATH DE number 2042286 (Why is no real title available?)
• scientific article; zbMATH DE number 1867206 (Why is no real title available?)
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• A stable marriage of Poisson and Lebesgue
• College Admissions and the Stability of Marriage
• Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
• Eternal family trees and dynamics on unimodular random graphs
• Extra heads and invariant allocations
• Group-invariant percolation on graphs
• Groups of Automorphisms of Borel Spaces
• Indistinguishability of percolation clusters
• Invariant transports of stationary random measures and mass-stationarity
• Processes on unimodular random networks
• Representation of invariant measures
• Stable transports between stationary random measures
• Station�re zuf�llige Ma�e auf lokalkompakten Abelschen Gruppen
• Stochastic and Integral Geometry
• Transforming random elements and shifting random fields
• Trees and matchings from point processes
• Unimodular random trees

Cited in

(11)

• Doeblin trees
• Counter examples to invariant circle packing
• Unimodular Hausdorff and Minkowski dimensions
• Coupling from the past for the null recurrent Markov chain
• Eternal family trees and dynamics on unimodular random graphs
• Processes on unimodular random networks
• A strong duality principle for equivalence couplings and total variation
• Equidecomposition in cardinal algebras
• Invariance, quasi-invariance, and unimodularity for random graphs
• Non-intersection of transient branching random walks
• Counterexamples for percolation on unimodular random graphs

This page was built for publication: Shift-coupling of random rooted graphs and networks

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