Cut Vertices in Random Planar Maps
random planar maps
cut vertices
generating functions
local graph limits
- Mathematics of computing → Random graphs
Abstract. The main goal of this paper is to determine the asymptotic behavior of the number X_n of cut-vertices in random planar maps with n edges. It is shown that X_n/n → c in probability (for some explicit c>0). For so-called subcritial subclasses of planar maps like outerplanar maps we obtain a central limit theorem, too.