Large components of bipartite random mappings
โ Scribed by Jennie Hansen; Jerzy Jaworski
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 204 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
โฆ Synopsis
V 2 = L, into itself assigns independently to each i โ V 1 its unique image j โ V 2 with probability 1/L and to each i โ V 2 its unique image j โ V 1 with probability 1/K. We study the connected component structure of a random digraph G T K L , representing T K L , as K โ โ and L โ โ. We show that, no matter how K and L tend to infinity relative to each other, the joint distribution of the normalized order statistics for the component sizes converges in distribution to the Poisson-Dirichlet distribution on the simplex โ = x i x i โค 1 x i โฅ x i+1 โฅ 0 for every i โฅ 1 .
๐ SIMILAR VOLUMES
Mapping patterns may be represented by unlabelled directed graphs in which each point has outdegree one. We consider the uniform probability measure on the set of all mapping patterns on \(n\) points and derive the limiting distribution of the size of the largest tree as \(n \rightarrow \infty\). It