๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Size of the Largest Components in Random Planar Maps

โœ Scribed by Gao, Zhicheng; Wormald, Nicholas C.

Book ID
118198118
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
282 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The size of the largest hole in a random
The size of the largest hole in a random graph
โœ Tomasz ลuczak ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined

The Distribution of the Maximum Vertex D
The Distribution of the Maximum Vertex Degree in Random Planar Maps
โœ Zhicheng Gao; Nicholas C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 297 KB

We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of an n-gon, and show that it is the same as that of the maximum of n independent identically distributed random variables G 2 , where G 2 is the sum of two independent geometric(1ร‚2) random variables.

On the Largest Component of the Random G
On the Largest Component of the Random Graph at a Nearcritical Stage
โœ Boris Pittel ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 225 KB

The random graphs G(n, Pr(edge)= p), G(n, \*edges=M) at the critical range p=(1+\*n &1ร‚3 )ร‚n and M=(nร‚2)(1+\*n &1ร‚3 ) are studied. The limiting distribution of the largest component size is determined.