on the diameter of random planar graphsfusy/talks/aofa2010.pdf(modulo series-parallel operations)...
TRANSCRIPT
![Page 1: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/1.jpg)
On the diameter of randomplanar graphs
Eric Fusy (LIX, Ecole Polytechnique)joint work with Guillaume Chapuy, Omer Gimenez, Marc Noy
![Page 2: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/2.jpg)
Planar maps / planar graphs• Planar map = planar embedding of a graph
![Page 3: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/3.jpg)
Planar maps / planar graphs• Planar map = planar embedding of a graph
(rooting is enough to avoid symmetries)
![Page 4: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/4.jpg)
Planar maps / planar graphs• Planar map = planar embedding of a graph
• Planar graph = graph with at least one planar embedding
(needs to label all vertices to avoid symmetries)
(rooting is enough to avoid symmetries)
crossing
Nonplanar Planar
![Page 5: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/5.jpg)
Planar maps / planar graphs• Planar map = planar embedding of a graph
• Planar graph = graph with at least one planar embedding
(needs to label all vertices to avoid symmetries)
(rooting is enough to avoid symmetries)
• Random planar graph Gn random planar map Mn
crossing
Nonplanar Planar
![Page 6: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/6.jpg)
Main resultTheorem: Let Gn be the random (unembedded) planargraph with n vertices. Then
Conjecture:
![Page 7: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/7.jpg)
Related results
![Page 8: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/8.jpg)
Overview• We recall the classical scheme:
![Page 9: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/9.jpg)
Overview• We recall the classical scheme:
• Can carry out counting (exact/asymptotic) along the scheme:[Bender,Gao,Wormald’02], [Giménez,Noy’05]
![Page 10: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/10.jpg)
Overview• We recall the classical scheme:
• Can carry out counting (exact/asymptotic) along the scheme:
• Here we carry large deviation statements of the form:
[Bender,Gao,Wormald’02], [Giménez,Noy’05]
![Page 11: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/11.jpg)
Overview• We recall the classical scheme:
• Can carry out counting (exact/asymptotic) along the scheme:
• Here we carry large deviation statements of the form:
[Bender,Gao,Wormald’02], [Giménez,Noy’05]
![Page 12: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/12.jpg)
Part I: counting scheme forconnected planar graphs
![Page 13: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/13.jpg)
Connectivity in graphs
• [Tutte’66]:- a connected graph decomposes into 2-connected components- a 2-connected graph decomposes into 3-connected components
General
Connected
2-connected
3-connected
![Page 14: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/14.jpg)
Connected -> 2-connected
• Vertex-rooted formulation:
The incidences between cut-vertices and blocks forms a tree
![Page 15: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/15.jpg)
2-connected -> 3-connected
![Page 16: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/16.jpg)
2-connected -> 3-connected
![Page 17: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/17.jpg)
2-connected -> 3-connected
![Page 18: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/18.jpg)
2-connected -> 3-connected
![Page 19: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/19.jpg)
2-connected -> 3-connected
• Edge-rooted formulation [Trakhtenbrot’58]:
or or
An edge-rooted 2-connected planar graph is either:
(modulo series-parallel operations)
![Page 20: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/20.jpg)
3-connected graphs -> maps• [Whitney]: 3-connected planar graphs 3-connected maps• [Tutte’63]: Use the decomposition the reverse way
and take the embedding into account
![Page 21: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/21.jpg)
Count graphs reduces to count maps
![Page 22: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/22.jpg)
Count maps via quadrangulations• There are several methods to count (rooted) maps:
- recursive [Tutte’63]- bijective: either directly or via quadrangulations
![Page 23: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/23.jpg)
Count maps via quadrangulations• There are several methods to count (rooted) maps:
- recursive [Tutte’63]- bijective: either directly or via quadrangulations
• Bijection between maps and quadrangulations ([Tutte]):1) Insert a star inside each face2) Delete the edges of the original map
#rooted maps n edges = #rooted quadrangulations n faces
![Page 24: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/24.jpg)
Quad. <-> well-labelled trees
1) Start from a vertex-pointed quadrangulation with vertices labelled by the distance from the pointed vertex
Bijection [Schaeffer’98] (also [Cori,Vauquelin’84]):
![Page 25: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/25.jpg)
Quad. <-> well-labelled trees
2) Draw a black edge in each face according to the rule:
Bijection [Schaeffer’98] (also [Cori,Vauquelin’84]):
![Page 26: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/26.jpg)
Quad. <-> well-labelled trees
3) Delete the red edges and the pointed vertex
Bijection [Schaeffer’98] (also [Cori,Vauquelin’84]):
![Page 27: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/27.jpg)
Quad. <-> well-labelled trees
• A well-labelled tree is a plane tree where:
- each vertex v has a positive label
- at least one vertex has label 1
- the labels at each edge (v,v’) differ by at most 1
![Page 28: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/28.jpg)
Quad. <-> well-labelled trees
• A well-labelled tree is a plane tree where:
- each vertex v has a positive label
- at least one vertex has label 1
- the labels at each edge (v,v’) differ by at most 1
• Rooted well-labelled tree = well-labelled tree + marked corner
(there are such trees with n edges)
![Page 29: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/29.jpg)
The mapping is a bijectionTheorem [Schaeffer’98]: The mapping is a bijectionbetween pointed quadrangulations and well-labelled trees
vertex label i vertex at distance i
corner label i edge at level i
edge face
![Page 30: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/30.jpg)
The mapping is a bijectionTheorem [Schaeffer’98]: The mapping is a bijectionfrom well-labelled trees to pointed quadrangulations
vertex label i vertex at distance i
corner label i edge at level i
edge face
Corollary: there are quadrangulations with n faces,a marked vertex, and a marked edge
![Page 31: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/31.jpg)
Summary of counting scheme
![Page 32: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/32.jpg)
Part II: carry large deviationestimates for the diameteralong the counting scheme
![Page 33: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/33.jpg)
• We carry large deviation statements of the form:
![Page 34: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/34.jpg)
• We carry large deviation statements of the form:
![Page 35: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/35.jpg)
Quad. via well-labelled treesLet Qn random pointed quadrangulation with n+1 vertices Qn Tn the random well-labelled tree with n vertices
h(Tn) of order n1/2
Radius(Qn) ``of order’’ n1/4
+ discrepancy of labels along k-path is of order k1/2
![Page 36: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/36.jpg)
Quad. via well-labelled treesLet Qn random pointed quadrangulation with n+1 vertices Qn Tn the random well-labelled tree with n vertices
h(Tn) of order n1/2
+ discrepancy of labels along k-path is of order k1/2
(Precise convergence results in [Chassaing Schaeffer’04])
easily:
![Page 37: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/37.jpg)
Quadrangulations -> Maps
M Q
![Page 38: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/38.jpg)
Maps -> 2-connected maps[Gao,Wormald’99], [Banderier,Flajolet,Schaeffer,Soria’01]:• The random map Mn has typically a core of size n/3 +n2/3 θ• The other components are small (size O(n2/3))
Airylaw
Diam(Mn) Diam(Bn/3)
![Page 39: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/39.jpg)
• For each of the highlighted families:
![Page 40: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/40.jpg)
• For each of the highlighted families:
• Can carry it until connected planar graphs
![Page 41: On the diameter of random planar graphsfusy/Talks/Aofa2010.pdf(modulo series-parallel operations) 3-connected graphs -> maps •[Whitney]: 3-connected planar graphs 3-connected maps](https://reader034.vdocument.in/reader034/viewer/2022050605/5facd3f2b26cc4716248e5e1/html5/thumbnails/41.jpg)
• For each of the highlighted families:
• Can carry it until connected planar graphs
• Is it possible to carry a statement such as E(Diam(Gn))= Θ(n1/4) ?