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

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


Characterization of random mappings
โœ I. B. Kalugin ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 314 KB
Large Trees in a Random Mapping Pattern
โœ Lyuben Mutafchiev ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

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

Random mappings of scaled graphs
โœ Anna Erschler ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 390 KB