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

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)

• 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
• Eigenvalues of random lifts and polynomials of random permutation matrices
• Unimodular hyperbolic triangulations: circle packing and random walk
• Limits of discrete distributions and Gibbs measures on random graphs
• Ground states for exponential random graphs
• Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
• The local limit of uniform spanning trees
• Transitive graphs uniquely determined by their local structure
• Conformal growth rates and spectral geometry on distributional limits of graphs
• Invariant coupling of determinantal measures on sofic groups
• The boundary action of a sofic random subgroup of the free group
• Indistinguishability of the components of random spanning forests
• Spectral classes of regular, random, and empirical graphs
• Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces
• First-order limits, an analytical perspective
• Recent results of quantum ergodicity on graphs and further investigation
• An infinite-dimensional metapopulation SIS model
• Interacting growth processes and invariant percolation
• Coalescing random walk on unimodular graphs
• Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
• Local convergence of large random triangulations coupled with an Ising model
• A short proof of the equivalence of left and right convergence for sparse graphs
• Counterexamples for percolation on unimodular random graphs
• Load balancing in hypergraphs
• On invariant Schreier structures
• Indistinguishability of collections of trees in the uniform spanning forest
• Indistinguishability of trees in uniform spanning forests
• Approximating Cayley diagrams versus Cayley graphs
• The speed of the tagged particle in the exclusion process on Galton-Watson trees
• Locality of the critical probability for transitive graphs of exponential growth
• Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
• On the derivation of mean-field percolation critical exponents from the triangle condition
• Locality of random digraphs on expanders
• An interlacing technique for spectra of random walks and its application to finite percolation clusters
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
• Title not available (Why is that?)
• The hyperbolic Brownian plane
• Hyperfinite graphings and combinatorial optimization
• Entropy theory for sofic groupoids. I: The foundations
• 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

   Recommendations

• Invariance, quasi-invariance, and unimodularity for random graphs 👍 👎
• Unimodularity in Randomly Generated Graphs 👍 👎
• Shift-coupling of random rooted graphs and networks 👍 👎
• On the trace of branching random walks 👍 👎
• Counterexamples for percolation on unimodular random 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)