Limit theorems for sizes of trees in the unlabelled graph of a random mapping
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378930478 | ||
| 003 | CHVBK | ||
| 005 | 20180305123628.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20040801xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/1569392041938767 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/1569392041938767 | ||
| 100 | 1 | |a Pavlov |D Yu. L. | |
| 245 | 1 | 0 | |a Limit theorems for sizes of trees in the unlabelled graph of a random mapping |h [Elektronische Daten] |c [Yu. L. Pavlov] |
| 520 | 3 | |a We find limit distributions of the maximum size of a tree and of the number of trees of given size in an unlabelled random forest consisting of N rooted trees and n non-root vertices provided that N, n → ∞ so that 0 < C 1 ≤ N / √n ≤ C 2 < ∞. With the use of these results, for the unlabelled graph of a random single-valued mapping of the set {1, 2, . . .,n} into itself we prove theorems on the limit behaviour of the maximum tree size and of the number of trees of size r as n → ∞ in the cases of fixed r and r/n 1/3 ≥ C 3 > 0. | |
| 540 | |a Copyright 2004, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/4(2004-08-01), 329-342 |x 0924-9265 |q 14:4<329 |1 2004 |2 14 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/1569392041938767 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/1569392041938767 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Pavlov |D Yu. L. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/4(2004-08-01), 329-342 |x 0924-9265 |q 14:4<329 |1 2004 |2 14 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||