Euclidean vs. Graph Metric

DOI10.1007/978-3-642-39286-3_2MaRDI QIDQ5416073zbMATH OpenOpenAlexFDO

Authors Itai Benjamini

Publication date 19 May 2014

Published in Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39286-3_2

Mathematics Subject Classification ID

Distance in graphs (05C12) Density (toughness, etc.) (05C42)

Cited in

(10)

• Self-avoiding walks and amenability
• Locality of connective constants
• Classification of half-planar maps
• Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations
• A note on Schramm's locality conjecture for random-cluster models
• Asymptotics in percolation on high-girth expanders
• Limit of the Wulff crystal when approaching criticality for isoperimetry in 2D percolation
• Heat kernels are not uniform expanders
• Locality of the critical probability for transitive graphs of exponential growth
• Large unicellular maps in high genus

This page was built for publication: Euclidean vs. Graph Metric

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