随机映射块大小的概率方法
A probabilistic approach to block sizes in random maps
摘要:
我们提出了随机映射核心大小的概率方法,该方法对Banderier、Flajolet、Schaeffer和Soria的一些结果给出了简单且无需奇异性分析的证明。证明也产生依分布收敛的第k个最大的2-连通块在一个大的随机地图,对于任何固定的k > 1,到一个弗雷歇型极端顺序统计量的重新标度的大小。这似乎是一个新的结果,即使当k=2。
英文摘要:
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échet-type extreme order statistic. This seems to be a new result even when k=2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。