On limits of graphs sphere packed in Euclidean space and applications
From MaRDI portal
Publication:648959
DOI10.1016/j.ejc.2011.03.016zbMath1231.52015arXiv0907.2609MaRDI QIDQ648959
Nicolas Curien, Itai Benjamini
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2609
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
05C63: Infinite graphs
Related Items
Inventory Accumulation with $k$ Products, LACK OF SPHERE PACKING OF GRAPHS VIA NONLINEAR POTENTIAL THEORY, On the Riemann surface type of random planar maps, A finite subdivision rule for the \(n\)-dimensional torus, The triple intersection property, three dimensional extremal length, and tiling of a topological cube, Discrete uniformizing metrics on distributional limits of sphere packings, Distributional limits of Riemannian manifolds and graphs with sublinear genus growth, Doubling metric spaces are characterized by a lemma of Benjamini and Schramm, Growth and isoperimetric profile of planar graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- The ring Lemma in three dimensions
- On locally constructible spheres and balls
- Oded Schramm: from circle packing to SLE
- The convergence of circle packings to the Riemann mapping
- The extremal length of a network
- A remark on parabolic index of infinite networks
- Square tilings with prescribed combinatorics
- Parabolic index and rough isometries
- Potential theory on infinite networks
- Packings with large minimum kissing numbers
- Recurrence of distributional limits of finite planar graphs
- A short proof that a subquadratic isoperimetric inequality implies a linear one
- Hyperbolic and parabolic packings
- Average kissing numbers for non-congruent sphere packings
- Random walks and harmonic functions on infinite planar graphs using square tilings
- The dissection of rectangles into squares