Sparse graph limits along balls

DOI10.1090/CONM/719/14467zbMATH Open1425.05086OpenAlexW2901334741MaRDI QIDQ5236802FDOQ5236802

Authors: Itai Benjamini, Gábor Elek 

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

zbMATH Keywords

weighted hyperfinite sequences

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)

Cites Work

• Recurrence of distributional limits of finite planar graphs
• Processes on unimodular random networks
• Uniform local amenability
• Expanders are not hyperbolic
• Ergodic theory on stationary random graphs
• Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
• Random walk in random groups.
• A conjecture concerning a limit of non-Cayley graphs
• Presentations of finite simple groups: a computational approach.
• Hyperfinite graph limits
• Property A and the operator norm localization property for discrete metric spaces
• Random walks on Diestel-Leader graphs
• The combinatoral cost
• Transitive graphs uniquely determined by their local structure

Cited In (1)

• A counterexample to the Bollobás–Riordan conjectures on sparse graph limits

This page was built for publication: Sparse graph limits along balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236802)