Processes on unimodular random networks
From MaRDI portal
Publication:2462018
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)- The local limit of the uniform spanning tree on dense graphs
- Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
- Eigenvalues of random lifts and polynomials of random permutation matrices
- Maximum independent sets on random regular graphs
- Anomalous diffusion of random walk on random planar maps
- Recent results of quantum ergodicity on graphs and further investigation
- On invariant Schreier structures
- Spectral asymptotic expansion of Wishart matrices with exploding moments
- Indistinguishability of the components of random spanning forests
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Relations between scaling exponents in unimodular random graphs
- Genericity of chaos for colored graphs
- Ground states for exponential random graphs
- Sofic boundaries of groups and coarse geometry of sofic approximations
- Pagerank asymptotics on directed preferential attachment networks
- Indistinguishability of collections of trees in the uniform spanning forest
- Local convergence of large random triangulations coupled with an Ising model
- An infinite-dimensional metapopulation SIS model
- Atoms of the matching measure
- 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
- A short proof of the equivalence of left and right convergence for sparse graphs
- Connectivity of random geometric graphs related to minimal spanning forests
- Finite-energy infinite clusters without anchored expansion
- Approximating Cayley diagrams versus Cayley graphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
- The boundary action of a sofic random subgroup of the free group
- Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces
- Comparing graphs of different sizes
- First-order limits, an analytical perspective
- Interacting growth processes and invariant percolation
- Cheeger constants and \(L^2\)-Betti numbers
- Unimodular hyperbolic triangulations: circle packing and random walk
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Entropy theory for sofic groupoids. I: The foundations
- Spectra of large diluted but bushy random graphs
- Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs
- The hyperbolic Brownian plane
- Transitive graphs uniquely determined by their local structure
- Conformal growth rates and spectral geometry on distributional limits of graphs
- Kőnig's line coloring and Vizing's theorems for graphings
- Locality of random digraphs on expanders
- Interlacements and the wired uniform spanning forest
- An interlacing technique for spectra of random walks and its application to finite percolation clusters
- Invariant coupling of determinantal measures on sofic groups
- Limits of discrete distributions and Gibbs measures on random graphs
- Indistinguishability of trees in uniform spanning forests
- A nonamenable ``factor of a Euclidean space
- Emergence of extended states at zero in the spectrum of sparse random graphs
- Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
- Large deviations of empirical neighborhood distribution in sparse random graphs
- The local limit of uniform spanning trees
- Satisfiability threshold for random regular \textsc{nae-sat}
- Hyperfinite graphings and combinatorial optimization
- Load balancing in hypergraphs
- Counterexamples for percolation on unimodular random graphs
- Coalescing random walk on unimodular graphs
- Hyperbolic and parabolic unimodular random maps
- Continuity of the Ising phase transition on nonamenable groups
- Spectral classes of regular, random, and empirical graphs
- Uniform spanning forests of planar graphs
- The set of solutions of random XORSAT formulae
- Limits of structures and the example of tree semi-lattices
- Recurrence of planar graph limits
- Quantum ergodicity on graphs: from spectral to spatial delocalization
- On local weak limit and subgraph counts for sparse random graphs
- Spectrum of non-Hermitian heavy tailed random matrices
- On quantum percolation in finite regular graphs
- Infinitely presented permutation stable groups and invariant random subgroups of metabelian groups
- Invariant random subgroups of linear groups
- Applications of automata and graphs: Labeling operators in Hilbert space. II.
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- Renewal processes, population dynamics, and unimodular trees
- Harmonic models and spanning forests of residually finite groups
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- Graph theory. Abstracts from the workshop held January 13--19, 2013
- Ising models on locally tree-like graphs
- Unimodularity of invariant random subgroups
- Around the circular law
- Invariant transports of stationary random measures and mass-stationarity
- Mean quantum percolation
- On limits of finite graphs
- On the trace of branching random walks
- The weak limit of Ising models on locally tree-like graphs
- Unimodular random trees
- Parametric estimation for Gaussian fields indexed by graphs
- A new approach to the orientation of random hypergraphs
- Factor models on locally tree-like graphs
- Invariant embeddings of unimodular random planar graphs
- All properly ergodic Markov chains over a free group are orbit equivalent
- Ultraproducts of measure preserving actions and graph combinatorics
- Sparse random graphs with clustering
- Disorder, entropy and harmonic functions
- Planar stochastic hyperbolic triangulations
- The rank of diluted random graphs
- On the limit of large girth graph sequences
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Unimodularity for multi-type Galton-Watson trees
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
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)
