arXiv:1503.08159 [math.PR]AbstractReferencesReviewsResources
A probabilistic approach to block sizes in random maps
Published 2015-03-27Version 1
We present a probabilistic approach to the core-size in random maps, which yields straightforward and singularity analysis-free proofs of some results of Banderier, Flajolet, Schaeffer and Soria. The proof also yields convergence in distribution of the rescaled size of the k'th largest 2-connected block in a large random map, for any fixed k > 1, to a Fr\'echet-type extreme order statistic. This seems to be a new result even when k=2.
Comments: 7 pages, 4 figures
Related articles: Most relevant | Search more
A probabilistic proof of the fundamental gap conjecture via the coupling by reflection
arXiv:2004.10850 [math.PR] (Published 2020-04-22)
A probabilistic approach to convex $(φ)$-entropy decay for Markov chains
arXiv:1708.05626 [math.PR] (Published 2017-08-18)
Block sizes in two families of random permutations