Sparse graph limits along balls

DOI10.1090/CONM/719/14467MaRDI QIDQ5236802zbMATH OpenOpenAlexFDO

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

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

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)