𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Limit theorems for sizes of trees in the unlabelled graph of a random mapping

✍ Scribed by Pavlov, Yu L.


Book ID
120137507
Publisher
Walter de Gruyter GmbH & Co. KG
Year
2004
Tongue
English
Weight
90 KB
Volume
14
Category
Article
ISSN
0924-9265

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Limit theorems for sequences of random t
✍ David Balding; Pablo A. Ferrari; Ricardo Fraiman; Mariela Sued πŸ“‚ Article πŸ“… 2008 πŸ› CrossRef test prefix 🌐 English βš– 371 KB
Limit distribution for the existence of
✍ JΓ‘nos KomlΓ³s; Endre SzemerΓ©di πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 874 KB

P&a proved that a random graph with clt log n edges is Hamiltonian with probability tending to 1 if c >3. Korsunov improved this by showing that, if Gn is a random graph with \*n log n + in log log n + f(n)n edges and f(n) --\*m, then G" is Hamiltonian, with probability tending to 1. We shall prove