Processes on unimodular random networks
From MaRDI portal
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)- 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
- Finite-energy infinite clusters without anchored expansion
- Coalescing random walk on unimodular graphs
- Finitary random interlacements and the Gaboriau-Lyons problem
- Compact graphings
- Limits of structures and the example of tree semi-lattices
- The abelian sandpile model on randomly rooted graphs and self-similar groups
- Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
- Entropy and expansion
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- A nonamenable ``factor of a Euclidean space
- Emergence of extended states at zero in the spectrum of sparse random graphs
- On planar graphs of uniform polynomial growth
- Invariant embeddings of unimodular random planar graphs
- A note on the local weak limit of a sequence of expander graphs
- On the computational tractability of statistical estimation on amenable graphs
- Chemical subdiffusivity of critical 2D percolation
- Conformal growth rates and spectral geometry on distributional limits of graphs
- An infinite-dimensional metapopulation SIS model
- The planted matching problem: phase transitions and exact results
- Unimodular Hausdorff and Minkowski dimensions
- Invariant Schreier decorations of unimodular random networks
- Atoms of the matching measure
- Pagerank asymptotics on directed preferential attachment networks
- Typicality and entropy of processes on infinite trees
- Counter examples to invariant circle packing
- The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
- A conversation with David J. Aldous
- Unimodular measures on the space of all Riemannian manifolds
- The local limit of uniform spanning trees
- Scattering resonances of large weakly open quantum graphs
- Degrees in link graphs of regular graphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Proof of the satisfiability conjecture for large \(k\)
- On the speed and spectrum of mean-field random walks among random conductances
- Indistinguishability of collections of trees in the uniform spanning forest
- Local weak convergence for PageRank
- Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
- \(\ell^2\)-Betti numbers of random rooted simplicial complexes
- Heavy Bernoulli-percolation clusters are indistinguishable
- Non-intersection of transient branching random walks
- Zero-temperature Glauber dynamics on the 3-regular tree and the median process
- Anomalous diffusion of random walk on random planar maps
- Limiting entropy of determinantal processes
- Hyperfinite graphings and combinatorial optimization
- Local limits of uniform triangulations in high genus
- Genericity of chaos for colored graphs
- 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
- Errata to: ``Processes on unimodular random networks
- 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
- Hawkes processes on large networks
- The densest subgraph problem in sparse random graphs
- Second errata to: ``Processes on unimodular random networks
- Sparse expanders have negative curvature
- A tale of two balloons
- 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
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)
