Local limit of sparse random planar graphs

MaRDI QIDQ6359254zbMATH OpenFDO

Authors Mihyun Kang, Michael Missethan

Publication date 28 January 2021

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80)

Abstract: Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $left1,ldots,night$ with $m=m(n)$ edges. We determine the (Benjamini-Schramm) local weak limit of $P(n,m)$ in the sparse regime when $mleqn+oleft(nleft(lognight{)}^{-2/3}ight)$. Assuming that the average degree $2m/n$ tends to a constant $cin[0,2]$ the local weak limit of $P(n,m)$ is a Galton-Watson tree with offspring distribution $Po(c)$ if $cleq1$, while it is the Skeleton tree if $c=2$. Furthermore, there is a smooth transition between these two cases in the sense that the local weak limit of $P(n,m)$ is a linear combination of a Galton-Watson tree and the Skeleton tree if $cinleft(1,2ight)$.

This page was built for publication: Local limit of sparse random planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359254)