Euclidean vs. Graph Metric

DOI10.1007/978-3-642-39286-3_2zbMath1293.05199OpenAlexW155255179MaRDI QIDQ5416073

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)

Related Items (9)

Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations ⋮ Self-avoiding walks and amenability ⋮ Limit of the Wulff crystal when approaching criticality for isoperimetry in 2D percolation ⋮ Large unicellular maps in high genus ⋮ Asymptotics in percolation on high‐girth expanders ⋮ A Note on Schramm’s Locality Conjecture for Random-Cluster Models ⋮ Locality of connective constants ⋮ Locality of the critical probability for transitive graphs of exponential growth ⋮ Classification of half-planar maps

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