Processes on unimodular random networks

DOI10.1214/EJP.v12-463zbMath1131.60003arXivmath/0603062MaRDI QIDQ2462018

Publication date: 23 November 2007

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

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

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60K99: Special processes

60C05: Combinatorial probability

Related Items

The densest subgraph problem in sparse random graphs, A detailed investigation into near degenerate exponential random graphs, Structural limits and approximations of mappings, First order convergence of matroids, The limiting distributions of large heavy Wigner and arbitrary random matrices, On the phase transition in random simplicial complexes, Graph theory. Abstracts from the workshop held January 13--19, 2013, Unimodularity for multi-type Galton-Watson trees, Invariant monotone coupling need not exist, Matchings on infinite graphs, Random walks on Galton-Watson trees with random conductances, On the trace of branching random walks, Around the circular law, Belief propagation for optimal edge cover in the random complete graph, A stationary random graph of no growth rate, On the density of triangles and squares in regular finite and unimodular random graphs, Invariance, quasi-invariance, and unimodularity for random graphs, The rank of diluted random graphs, Bootstrap percolation in living neural networks, Spectrum of non-Hermitian heavy tailed random matrices, Stable orbit equivalence of Bernoulli shifts over free groups, Scale-invariant groups., Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm, On the limit of large girth graph sequences, The weak limit of Ising models on locally tree-like graphs, Harmonic models and spanning forests of residually finite groups, Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph, The measurable Kesten theorem, Unimodular hyperbolic triangulations: circle packing and random walk, Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs, Planar stochastic hyperbolic triangulations, The set of solutions of random XORSAT formulae, The boundary action of a sofic random subgroup of the free group, Large deviations of empirical neighborhood distribution in sparse random graphs, Sofic equivalence relations, Disorder, entropy and harmonic functions, Spectral classes of regular, random, and empirical graphs, On quantum percolation in finite regular graphs, First-order limits, an analytical perspective, A short proof of the equivalence of left and right convergence for sparse graphs, On limits of finite graphs, Ising models on locally tree-like graphs, Invariant transports of stationary random measures and mass-stationarity, The local limit of the uniform spanning tree on dense graphs, Load balancing in hypergraphs, The hyperbolic Brownian plane, Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces, Indistinguishability of the components of random spanning forests, Mean quantum percolation, Sofic boundaries of groups and coarse geometry of sofic approximations, Interlacements and the wired uniform spanning forest, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs, Finite graphs and amenability, Measurable chromatic and independence numbers for ergodic graphs and group actions, Recurrence of planar graph limits, An interlacing technique for spectra of random walks and its application to finite percolation clusters, Coalescing random walk on unimodular graphs, Finitary random interlacements and the Gaboriau-Lyons problem, Limits of structures and the example of tree semi-lattices, The abelian sandpile model on randomly rooted graphs and self-similar groups, Parametric estimation for Gaussian fields indexed by graphs, Entropy theory for sofic groupoids. I: The foundations, Interacting growth processes and invariant percolation, One-ended spanning trees in amenable unimodular graphs, Doeblin trees, Universality of high-dimensional spanning forests and sandpiles, Recent results of quantum ergodicity on graphs and further investigation, \(L^p\) norms and support of eigenfunctions on graphs, Statistical physics on a product of trees, Quantum ergodicity on graphs: from spectral to spatial delocalization, On the local geometry of graphs in terms of their spectra, Hyperbolic and parabolic unimodular random maps, Discrete uniformizing metrics on distributional limits of sphere packings, Eigenvalues of random lifts and polynomials of random permutation matrices, Cheeger constants and \(L^2\)-Betti numbers, On invariant Schreier structures, Spectral distances on graphs, Invariant random subgroups of linear groups, Indistinguishability of trees in uniform spanning forests, Diffusive estimates for random walks on stationary random graphs of polynomial growth, Limits of discrete distributions and Gibbs measures on random graphs, Limits of mappings, Maximum independent sets on random regular graphs, Factor models on locally tree-like graphs, Kesten's theorem for invariant random subgroups., Ising critical exponents on random trees and graphs, Limits of locally-globally convergent graph sequences, Transitive graphs uniquely determined by their local structure, Invariant coupling of determinantal measures on sofic groups, Spectra of large diluted but bushy random graphs, Weighted enumeration of spanning subgraphs in locally tree-like graphs, Approximating Cayley Diagrams Versus Cayley Graphs, Unimodularity of invariant random subgroups, KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS, Insertion-tolerance and repetitiveness of random graphs, Sparse random graphs with clustering, Resolvent of large random graphs, Applications of automata and graphs: Labeling operators in Hilbert space. II., Thompson’s group is not strongly amenable, Unnamed Item, Non-criticality criteria for Abelian sandpile models with sources and sinks, Random Simplicial Complexes: Around the Phase Transition, Convergence of graphs with intermediate density, Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests, Ultraproducts of measure preserving actions and graph combinatorics, First order limits of sparse graphs: Plane trees and path-width, Invariant measures on the space of horofunctions of a word hyperbolic group, UNIFORM SPANNING FORESTS OF PLANAR GRAPHS, Sparse graphs: Metrics and random models, Speeding up non-Markovian first-passage percolation with a few extra edges, Renewal processes, population dynamics, and unimodular trees, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Monotonicity of average return probabilities for random walks in random environments, Counterexamples for percolation on unimodular random graphs, Sparse graph limits along balls, Invariant tilings and unimodular decorations of Cayley graphs, Distributional lattices on Riemannian symmetric spaces, Eternal Family Trees and dynamics on unimodular random graphs, All properly ergodic Markov chains over a free group are orbit equivalent, Shift-coupling of random rooted graphs and networks, Unimodular random trees, Ends of unimodular random manifolds, First-Order Convergence and Roots, Comparing Graphs of Different Sizes, ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES, Hyperlinear and Sofic Groups: A Brief Guide, Unnamed Item, BROOKS’ THEOREM FOR MEASURABLE COLORINGS, Satisfiability threshold for random regular \textsc{nae-sat}, A new approach to the orientation of random hypergraphs, Ground states for exponential random graphs, Reversibility of a simple random walk on periodic trees, Identities and Inequalities for Tree Entropy, Borel oracles. An analytical approach to constant-time algorithms