Unimodular random trees

From MaRDI portal
Revision as of 19:16, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5245325

DOI10.1017/etds.2013.56zbMath1328.05166arXiv1207.1752OpenAlexW2015375519MaRDI QIDQ5245325

Oded Schramm, Russell Lyons, Itai Benjamini

Publication date: 8 April 2015

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

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




Related Items (27)

Local limits of spatial Gibbs random graphsLocal limits of bipartite maps with prescribed face degrees in high genusOn the speed of distance stationary sequencesLocal weak convergence for PageRankThe half plane UIPT is recurrentMean quantum percolationSparse expanders have negative curvatureEstimating global subgraph counts by samplingNon-intersection of transient branching random walksComparing Graphs of Different SizesIsing critical exponents on random trees and graphsThe Ihara zeta function for infinite graphsFinite-energy infinite clusters without anchored expansionInvariance, quasi-invariance, and unimodularity for random graphsEmpirical spectral measures of quantum graphs in the Benjamini-Schramm limitAge evolution in the mean field forest fire model via multitype branching processesRecent results of quantum ergodicity on graphs and further investigationWeak density of orbit equivalence classes of free group actionsLarge deviations of empirical neighborhood distribution in sparse random graphsRoute lengths in invariant spatial tree networksEternal Family Trees and dynamics on unimodular random graphsShift-coupling of random rooted graphs and networksHyperbolic and parabolic unimodular random mapsRandom intersection graphs with communitiesUnimodular measures on the space of all Riemannian manifoldsOn local weak limit and subgraph counts for sparse random graphsClassification of half-planar maps



Cites Work


This page was built for publication: Unimodular random trees