Recurrence of multiply-ended planar triangulations
From MaRDI portal
(Redirected from Publication:507781)
Abstract: In this note we show that a bounded degree planar triangulation is recurrent if and only if the set of accumulation points of some/any circle packing of it is polar (that is, planar Brownian motion avoids it with probability 1). This generalizes a theorem of He and Schramm [6] who proved it when the set of accumulation points is either empty or a Jordan curve, in which case the graph has one end. We also show that this statement holds for any straight-line embedding with angles uniformly bounded away from 0.
Recommendations
- Recurrence of planar graph limits
- Recurrence of distributional limits of finite planar graphs
- Planar maps, random walks and circle packing. École d'Été de Probabilités de Saint-Flour XLVIII -- 2018
- Recurrent random walks, Liouville's theorem and circle packings
- A recurrence/transience result for circle packings
Cited in
(8)- Harmonic Dirichlet functions on planar graphs
- Recurrence of distributional limits of finite planar graphs
- Recurrence of planar graph limits
- Recurrence of a weighted random walk on a circle packing with parabolic carrier
- The half plane UIPT is recurrent
- Wandering polygons and recurrent critical leaves
- Uniform spanning forests of planar graphs
- Planar maps, random walks and circle packing. École d'Été de Probabilités de Saint-Flour XLVIII -- 2018
This page was built for publication: Recurrence of multiply-ended planar triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507781)