Sparse graph limits along balls
From MaRDI portal
Publication:5236802
DOI10.1090/conm/719/14467zbMath1425.05086OpenAlexW2901334741MaRDI QIDQ5236802
Publication date: 16 October 2019
Published in: Unimodularity in Randomly Generated Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/719/14467
Cites Work
- Uniform local amenability
- Ergodic theory on stationary random graphs
- Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
- Presentations of finite simple groups: a computational approach.
- Hyperfinite graph limits
- Expanders are not hyperbolic
- Random walk in random groups.
- Recurrence of distributional limits of finite planar graphs
- The combinatoral cost
- Property A and the operator norm localization property for discrete metric spaces
- Processes on unimodular random networks
- Transitive graphs uniquely determined by their local structure
- A conjecture concerning a limit of non-Cayley graphs
- Random walks on Diestel-Leader graphs
This page was built for publication: Sparse graph limits along balls
