Author:
CHAPUY GUILLAUME,FUSY ÉRIC,GIMÉNEZ OMER,NOY MARC
Abstract
We show that the diameter diam(Gn) of a random labelled connected planar graph withnvertices is equal ton1/4+o(1), in probability. More precisely, there exists a constantc> 0 such that$$ P(\D(G_n)\in(n^{1/4-\e},n^{1/4+\e}))\geq 1-\exp(-n^{c\e}) $$for ε small enough andn ≥ n0(ε). We prove similar statements for 2-connected and 3-connected planar graphs and maps.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference34 articles.
1. A Bijection for Rooted Maps on Orientable Surfaces
2. Dividing a Graph into Triconnected Components
3. Schaeffer G. (1998) Conjugaison d'arbres et cartes combinatoires aléatoires. PhD thesis, Université Bordeaux I.
4. The Brownian map is the scaling limit of uniform random plane quadrangulations
5. The maximum degree of random planar graphs;Drmota;SODA 2012,2012
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献