Unimodular hyperbolic triangulations: circle packing and random walk (Q730189)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unimodular hyperbolic triangulations: circle packing and random walk |
scientific article |
Statements
Unimodular hyperbolic triangulations: circle packing and random walk (English)
0 references
23 December 2016
0 references
A circle packing of a planar graph \(G\) is a set of circles with disjoint interiors, one for each vertex of \(G\), such that two circles are tangent if and only if their corresponding vertices are adjacent in \(G\). The famous Koebe-Andreev-Thurston theorem states that every finite simple plane graph has a circle packing. Moreover, if this graph is a triangulation, the packing is unique up to Möbius transformations and reflections. Also it is known that any infinite one-ended simple triangulation admits a locally finite circle packing either in the Euclidean plane (parabolic circle packing) or in the hyperbolic plane (hyperbolic circle packing). Now let \(G\) be an infinite, simple, one-ended, ergodic unimodular random rooted planar triangulation with the root \(\rho\). Then either \(\mathbb{E}[\deg(\rho)]=6\) and \(G\) almost surely admits a parabolic circle packing, or \(\mathbb{E}[\deg(\rho)]>6\) and \(G\) almost surely admits a hyperbolic circle packing. Further, consider a hyperbolic case with the supplementary condition \(\mathbb{E}[\deg^2(\rho)]<\infty\). Let \((X_n)\) be a simple random walk on \(G\). We can realize a hyperbolic plane as a disc \(\mathbb{D}=\{|z|<1\}\) with corresponding hyperbolic metric. Denote by \(z(X_n)\) and \(r(X_n)\) the Euclidean centre and radius of the circle corresponding to \(X_n\). Then \(z(X_n)\) almost surely converge to a random point on \(\partial D\). The law of this point has full support and no atoms. Also we have that \(\lim\limits_{n\to\infty} \frac{-\log r(X_n)}{n}>0\).
0 references
circle packings
0 references
Euclidian plane
0 references
hyperbolic plane
0 references
graphs
0 references
random triangulations
0 references
random walks
0 references
harmonic functions
0 references