A graph is of parabolic or hyperbolic type if the simple random walk on the vertices is, respectively, recurrent or transient. A plane triangulation graph is CP-parabolic or CP-hyperbolic if the maximal circle packing determined by the graph packs, respectively, the complex plane C or the Poincar e disk D. We examine the implications that (Gromov) negative curvature carries for determining type, speciically in these settings. Our main result is encased in the following theorem. Theorem. Every proper (Gromov) negatively curved metric space whose boundary contains a nontrivial continuum admits a (2; C)-quasi-isometric embedding of a uniform binary tree. Corollaries of this theorem include 1. the simple random walk on every locally nite, negatively curved graph whose boundary contains a nontrivial continuum is transient; 2. the simple random walk on a locally nite, 1-ended negatively curved graph whose boundary contains more than one point is transient; 3. a negatively curved plane triangulation graph is CP-hyperbolic if and only if it has a circle boundary (equivalently, CP-parabolic if and only if it has a point boundary). The classical \type problem" is that of determining whether a given noncom-pact, simply connected riemann surface is conformally equivalent to the plane C or the disk D. The surface is said to be of parabolic type in the former case, and of hyperbolic type in the latter. Our concern is with two related discretizations of this classical problem, one via random walks on graphs, the other via planar circle packings. Connections between probabilistic characteristics and the type problem are deep and intimate, and have been known for a long time. For instance, a simply connected riemann surface is hyperbolic if and only if a Brownian traveler starting at any point has a positive escape probability. This generalizes to higher dimensional riemannian manifolds. A complete riemannian manifold is hyperbolic exactly when the Brownian motion generated by the Laplace-Beltrami operator is transient. Kanai discretized this in 26, 27] where he characterized hyperbolic rie-mannian manifolds of bounded geometry as, roughly, those that are quasi-isometric to certain graphs of hyperbolic type. Another discretization of type has occured more recently in the very geometric/combinatorial setting of circle packings, this a purely 2-dimensional phenomenon. Here, a triangulation of the plane determines a Date: August 16, 1997. The author thanks the Department of Pure Mathematics and Mathematical Statistics at Cam-bridge University for their kind hospitality during his sabbatical visit in the rst …
[1]
A. Haefliger,et al.
Group theory from a geometrical viewpoint
,
1991
.
[2]
Singh M. Nayan,et al.
On Fixed Points
,
1981
.
[3]
A. Aleksandrov,et al.
Intrinsic Geometry of Surfaces
,
1967
.
[4]
山下 靖,et al.
THE UNIFORMATION THEOREM FOR CIRCLE PACKINGS
,
1995
.
[5]
Alano Ancona,et al.
Positive harmonic functions and hyperbolicity
,
1988
.
[6]
V. Kaimanovich.
Dirichlet norms, capacities and generalized isoperimetric inequalities for Markov operators
,
1992
.
[7]
É. Ghys,et al.
Sur Les Groupes Hyperboliques D'Apres Mikhael Gromov
,
1990
.
[8]
J. Jost.
Spaces of nonpositive curvature
,
1997
.
[9]
Masahiko Kanai,et al.
Rough isometries, and combinatorial approximations of geometries of non ∙ compact riemannian manifolds
,
1985
.
[10]
Igor Nikolaev,et al.
Generalized Riemannian spaces
,
1986
.
[11]
Peter G. Doyle,et al.
Random Walks and Electric Networks: REFERENCES
,
1987
.
[12]
S. Northshield.
GEODESICS AND BOUNDED HARMONIC FUNCTIONS ON INFINITE PLANAR GRAPHS
,
1991
.
[13]
Wolfgang Woess,et al.
Random Walks on Infinite Graphs and Groups — a Survey on Selected topics
,
1994
.
[14]
Oded Schramm,et al.
Fixed points, Koebe uniformization and circle packings
,
1993
.
[15]
Tomasz Dubejko,et al.
Recurrent random walks, Liouville's theorem and circle packings
,
1995,
Mathematical Proceedings of the Cambridge Philosophical Society.
[16]
M. Kanai.
Rough isometries and the parabolicity of riemannian manifolds
,
1986
.
[17]
R. J. Duffin,et al.
The extremal length of a network
,
1962
.