The half plane UIPT is recurrent (Q2413242)

This paper proves recurrence of the half plane version of the uniform infinite planar triangulation (UIPT). Planar map is a proper embedding of a connected graph in the plane. It breaks the complement of the map into components called faces. A planar map where all the faces are triangles is called a planar triangulation. In contrast, half plane triangulation has a boundary face that is incident to a doubly infinite path in the graph, while still requiring all the other faces to be triangles. UIPT is defined as limit object of uniformly chosen finite (with finite amount of vertices) planar triangulations in certain weak topology. HUIPT (half plane uniform infinite planar triangulation) is constructed similarly to UIPT, but as a limit object of half planar triangulations. The main result of this paper is proving that HUIPT is recurrent, that is, the simple random walk on HUIPT is almost-surely recurrent. This fact was proven for UIPT in [\textit{O. Gurel-Gurevich} and \textit{A. Nachmias}, Ann. Math. (2) 177, No. 2, 761--781 (2013; Zbl 1262.05031)]. However, since it is not known if HUIPT is subgraph of UIPT and HUIPT is not a limit of finite planar triangulations then its recurrence does not directly follow from referred result or methods used therein. The main novelty of this work lies in construction of a certain random full plane map \(M\), called the layered UIPT. It contains the HUIPT as a subgraph and it is proved that \(M\) is recurrent, implying that the HUIPT is also recurrent.