加载中…
We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every , as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees established in a previous work. After proving local convergence of the associated decorated trees, we extend the bijection to infinite trees and transfer the convergence to planar maps. The limiting object is almost surely one-ended and recurrent for the simple random walk.

生成讲解博客的中文版本

生成AI智能校验的中文版本