Processes on unimodular random networks

DOI10.1214/EJP.V12-463zbMATH Open1131.60003arXivmath/0603062OpenAlexW2165114349MaRDI QIDQ2462018FDOQ2462018

David Aldous, Russell Lyons

Publication date: 23 November 2007

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

Abstract: We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning random walks, percolation, spanning forests, and amenability from the known context of unimodular quasi-transitive graphs to the more general context of unimodular random networks. We give properties of a trace associated to unimodular random networks with applications to stochastic comparison of continuous-time random walk.

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

Recommendations

• Invariance, quasi-invariance, and unimodularity for random graphs
• Unimodularity in randomly generated graphs. AMS special session on unimodularity in randomly generated graphs, Denver, CO, USA, October 8--9, 2016. Proceedings
• Shift-coupling of random rooted graphs and networks
• On the trace of branching random walks
• Counterexamples for percolation on unimodular random graphs

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• On quantum percolation in finite regular graphs
• On local weak limit and subgraph counts for sparse random graphs
• Unimodularity of invariant random subgroups
• Sparse random graphs with clustering
• Hawkes processes on large networks
• The densest subgraph problem in sparse random graphs
• Matchings on infinite graphs
• Belief propagation for optimal edge cover in the random complete graph
• Invariant monotone coupling need not exist
• Planar stochastic hyperbolic triangulations
• Resolvent of large random graphs
• Finite graphs and amenability
• Invariant measures on the space of horofunctions of a word hyperbolic group
• Renewal processes, population dynamics, and unimodular trees
• Mean quantum percolation
• On the trace of branching random walks
• Ising models on locally tree-like graphs
• Convergence of graphs with intermediate density
• Quantum ergodicity on graphs: from spectral to spatial delocalization
• Around the circular law
• Finitary random interlacements and the Gaboriau-Lyons problem
• Ultraproducts of measure preserving actions and graph combinatorics
• Factor models on locally tree-like graphs
• Harmonic models and spanning forests of residually finite groups
• Disorder, entropy and harmonic functions
• Recurrence of planar graph limits
• Applications of automata and graphs: Labeling operators in Hilbert space. II.
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Reversibility of a simple random walk on periodic trees
• A detailed investigation into near degenerate exponential random graphs
• Invariant transports of stationary random measures and mass-stationarity
• Sparse graphs: Metrics and random models
• Structural limits and approximations of mappings
• First order convergence of matroids
• Borel oracles. An analytical approach to constant-time algorithms
• Bootstrap percolation in living neural networks
• The limiting distributions of large heavy Wigner and arbitrary random matrices
• On the phase transition in random simplicial complexes
• Spectrum of non-Hermitian heavy tailed random matrices
• The weak limit of Ising models on locally tree-like graphs
• Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph
• The measurable Kesten theorem
• A stationary random graph of no growth rate
• The set of solutions of random XORSAT formulae
• The rank of diluted random graphs
• The abelian sandpile model on randomly rooted graphs and self-similar groups
• Weighted enumeration of spanning subgraphs in locally tree-like graphs
• Graph theory. Abstracts from the workshop held January 13--19, 2013
• On limits of finite graphs
• On the density of triangles and squares in regular finite and unimodular random graphs
• Infinitely presented permutation stable groups and invariant random subgroups of metabelian groups
• Hyperlinear and Sofic Groups: A Brief Guide
• Scale-invariant groups.
• Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
• Unimodular random trees
• Unimodularity for multi-type Galton-Watson trees
• A conversation with David J. Aldous
• Measurable chromatic and independence numbers for ergodic graphs and group actions
• Errata to: ``Processes on unimodular random networks
• Invariance, quasi-invariance, and unimodularity for random graphs
• Parametric estimation for Gaussian fields indexed by graphs
• Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
• Stable orbit equivalence of Bernoulli shifts over free groups
• Sofic equivalence relations
• Limits of structures and the example of tree semi-lattices
• Invariant embeddings of unimodular random planar graphs
• Random walks on Galton-Watson trees with random conductances
• Invariant random subgroups of linear groups
• Kesten's theorem for invariant random subgroups.
• A new approach to the orientation of random hypergraphs
• On the limit of large girth graph sequences
• \(L^p\) norms and support of eigenfunctions on graphs
• Identities and Inequalities for Tree Entropy
• All properly ergodic Markov chains over a free group are orbit equivalent
• Limits of mappings
• Ising critical exponents on random trees and graphs
• Limits of locally-globally convergent graph sequences
• Finite-energy infinite clusters without anchored expansion
• A nonamenable ``factor of a Euclidean space
• Emergence of extended states at zero in the spectrum of sparse random graphs
• Maximum independent sets on random regular graphs
• Pagerank asymptotics on directed preferential attachment networks
• Cheeger constants and \(L^2\)-Betti numbers
• Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
• Anomalous diffusion of random walk on random planar maps
• Relations between scaling exponents in unimodular random graphs
• Interlacements and the wired uniform spanning forest
• Hyperbolic and parabolic unimodular random maps
• Sofic boundaries of groups and coarse geometry of sofic approximations
• A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
• Satisfiability threshold for random regular \textsc{nae-sat}
• Genericity of chaos for colored graphs
• Atoms of the matching measure
• Comparing Graphs of Different Sizes
• Spectra of large diluted but bushy random graphs
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests
• Continuity of the Ising phase transition on nonamenable groups
• The local limit of the uniform spanning tree on dense graphs

This page was built for publication: Processes on unimodular random networks

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