Sharp concentration of the number of submaps in random planar triangulations (Q558223): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Zhi-Cheng Gao / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Nicholas C. Wormald / rank | |||
Normal rank |
Revision as of 04:10, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sharp concentration of the number of submaps in random planar triangulations |
scientific article |
Statements
Sharp concentration of the number of submaps in random planar triangulations (English)
0 references
5 July 2005
0 references
The maximum degree \(\Delta_n\) of a random rooted triangulation on \(n\) vertices has \[ \biggl| \Delta_n - {{\log n - {{1}\over{2}}\log \log n}\over{\log(4/3)}}\biggr| \geq \Omega_n \] with probability \(O(1/\log n + (3/4)^{\Omega_n})\) where \(\Omega_n\to\infty\) arbitrarily slowly. Similar sharp concentration results are given on the number of vertices of given degree in random planar maps.
0 references
random graphs
0 references
planar maps
0 references