Sharp Concentration of the Number of Submaps in Random Planar Triangulations


We show that the maximum vertex degree in a random 3-connected planar triangulation is concentrated in an interval of almost constant width. This is a slightly weaker type of result than our earlier determination of the limiting distribution of the maximum vertex degree in random planar maps and in random triangulations of a (convex) polygon. We also derive… (More)
DOI: 10.1007/s00493-003-0028-x


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics