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.
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
Cited in
(only showing first 100 items - show all)- Entropy theory for sofic groupoids. I: The foundations
- On quantum percolation in finite regular graphs
- Ising critical exponents on random trees and graphs
- Limits of locally-globally convergent graph sequences
- Limiting entropy of determinantal processes
- Finite-energy infinite clusters without anchored expansion
- On the local geometry of graphs in terms of their spectra
- Thompson's group F is not strongly amenable
- Counterexamples for percolation on unimodular random graphs
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
- A nonamenable ``factor of a Euclidean space
- Emergence of extended states at zero in the spectrum of sparse random graphs
- The local weak limit of \(k\)-dimensional hypertrees
- Maximum independent sets on random regular graphs
- Pagerank asymptotics on directed preferential attachment networks
- Unimodularity of invariant random subgroups
- Hawkes processes on large networks
- The densest subgraph problem in sparse random graphs
- Sparse random graphs with clustering
- Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs
- Cheeger constants and L^2-Betti numbers
- Unimodular measures on the space of all Riemannian manifolds
- On local weak limit and subgraph counts for sparse random graphs
- Anomalous diffusion of random walk on random planar maps
- Matchings on infinite graphs
- A unified framework for generalizing the Gromov-Hausdorff metric
- Zero-temperature Glauber dynamics on the 3-regular tree and the median process
- Heat kernels are not uniform expanders
- Belief propagation for optimal edge cover in the random complete graph
- Sparse graph limits along balls
- Relations between scaling exponents in unimodular random graphs
- Co-spectral radius of intersections
- Harnack inequality and one-endedness of UST on reversible random graphs
- Local limits of uniform triangulations in high genus
- Invariant monotone coupling need not exist
- Kőnig's line coloring and Vizing's theorems for graphings
- Eternal family trees and dynamics on unimodular random graphs
- Planar stochastic hyperbolic triangulations
- Compact graphings
- Discrete uniformizing metrics on distributional limits of sphere packings
- Finite graphs and amenability
- Limit distributions of branching Markov chains
- Co-spectral radius for countable equivalence relations
- Resolvent of large random graphs
- Insertion-tolerance and repetitiveness of random graphs
- Spectral dimension, Euclidean embeddings, and the metric growth exponent
- Invariant measures on the space of horofunctions of a word hyperbolic group
- Interlacements and the wired uniform spanning forest
- Renewal processes, population dynamics, and unimodular trees
- Statistical physics on a product of trees
- On the trace of branching random walks
- Random eigenvalues of graphenes and the triangulation of plane
- Mean quantum percolation
- Trees of intermediate volume growth (extended abstract)
- First-Order Convergence and Roots
- Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees
- Hyperbolic and parabolic unimodular random maps
- Sofic boundaries of groups and coarse geometry of sofic approximations
- The wired minimal spanning forest on the Poisson-weighted infinite tree
- Uniform spanning forests of planar graphs
- Monotonicity for continuous-time random walks
- Ising models on locally tree-like graphs
- Genericity of chaos for colored graphs
- Marginal dynamics of interacting diffusions on unimodular Galton-Watson trees
- Atoms of the matching measure
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Satisfiability threshold for random regular \textsc{nae-sat}
- Spectral asymptotic expansion of Wishart matrices with exploding moments
- Spectra of large diluted but bushy random graphs
- Equivariant Benjamini-Schramm convergence of simplicial complexes and \(\ell^2\)-multiplicities
- Around the circular law
- The local limit of the uniform spanning tree on dense graphs
- Convergence of graphs with intermediate density
- Quantum ergodicity on graphs: from spectral to spatial delocalization
- Scattering resonances of large weakly open quantum graphs
- Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
- Convergence of normalized Betti numbers in nonpositive curvature
- Continuity of the Ising phase transition on nonamenable groups
- Finitary random interlacements and the Gaboriau-Lyons problem
- All properly ergodic Markov chains over a free group are orbit equivalent
- Eigenvalues of random lifts and polynomials of random permutation matrices
- Large, lengthy graphs look locally like lines
- On invariant generating sets for the cycle space
- Unimodular hyperbolic triangulations: circle packing and random walk
- Factor models on locally tree-like graphs
- Finitely dependent random colorings of bounded degree graphs
- Harmonic models and spanning forests of residually finite groups
- Ultraproducts of measure preserving actions and graph combinatorics
- Degrees in link graphs of regular graphs
- Disorder, entropy and harmonic functions
- Entropy and expansion
- Max-min theorems for weak containment, square summable homoclinic points, and completely positive entropy
- Limits of discrete distributions and Gibbs measures on random graphs
- Double dimers on planar hyperbolic graphs via circle packings
- Recurrence of planar graph limits
- Stability of homomorphisms, coverings and cocycles. II: Examples, applications and open problems
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
- Factor-of-iid balanced orientation of non-amenable graphs
- Applications of automata and graphs: Labeling operators in Hilbert space. II.
- A detailed investigation into near degenerate exponential 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)
