Year: 1995
Type: article
Abstract: The contacts graph, or nerve, of a packing, is a combinatorial graph that describes the combinatorics of the packing. Let G be the 1-skeleton of a triangulation of an open disk. G is said to be CP parabolic (resp. CP hyperbolic) if there is a locally finite disk packing P in the plane (resp. the unit disk) with contacts graph G . Several criteria for deciding whether G is CP parabolic or CP hyperbolic are given, including a necessary and sufficient combinatorial criterion. A criterion in terms of the random walk says that if the random walk on G is recurrent, the G is CP parabolic. Conversely, if G has bounded valence and the random walk on G is transient, then G is CP hyperbolic. We also give a new proof that G is either CP parabolic or CP hyperbolic, but not both. The new proof has the advantage of being applicable to packings of more general shapes. Another new result is that if G is CP hyperbolic and D is any simply connected proper subdomain of the plane, then there is a disk packing P with contacts graph G such that P is contained and locally finite in D .
DOI: 10.1007/bf02570699
Authors: Zheng-Xu He, O. Schramm
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Keyword: disk packing
Open Access status: hybrid
Estimated APC paid: $3,090
Funder: National Science Foundation
OpenAlex ID: W2005704408
