Consider I:andom graphs with n labelled vertices in which the edges are chosen independently and with a 6lxed probability p, 0 <p C 1. Let y be a fixed real number, q = 1p, and denote by A the maximum degree. Then
The distribution of the root degree of a random permutation
✍ Scribed by Béla Bollobás; Boris Pittel
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 521 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar
Let T n denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ µ k n and variance ∼ σ 2 k n with positive constants µ
We improve a result of Liebeck and Saxl concerning the minimal degree of a primitive permutation group and use it to strengthen a result of Guralnick and Neubauer on generic covers of Riemann surfaces.