Hyperbolicity vs. amenability for planar graphs

DOI10.1007/s00454-017-9859-xzbMath1371.05194arXiv1509.02028OpenAlexW2962758363WikidataQ59614144 ScholiaQ59614144MaRDI QIDQ2408187

Bruno Federici, Angelos Georgakopoulos

Publication date: 10 October 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02028

zbMATH Keywords

hyperbolic graphcoarse geometryplanar graphnon-amenable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Infinite graphs (05C63)

Related Items (4)

Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters ⋮ Analyticity Results in Bernoulli Percolation ⋮ Percolation on hyperbolic graphs ⋮ The \(L^2\) boundedness condition in nonamenable percolation

Cites Work

• Unnamed Item
• Unnamed Item
• The boundary of a square tiling of a graph coincides with the Poisson boundary
• Coarse geometry and randomness. École d'Été de Probabilités de Saint-Flour XLI -- 2011
• Rough isometries, and combinatorial approximations of geometries of non- compact Riemannian manifolds
• Circle boundaries of planar graphs
• A short proof that a subquadratic isoperimetric inequality implies a linear one
• Geometric Group Theory
• Every planar graph with the Liouville property is amenable

This page was built for publication: Hyperbolicity vs. amenability for planar graphs