Asymptotics of random partitions of a set

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper contains two results on the asymptotic behavior of uniform probability measure on partitions of a finite set as its cardinality tends to infinity. The first one states that there exists a normalization of the corresponding Young diagrams such that the induced measure has a weak limit. This limit is shown to be a δ-measure supported by the unit square (Theorem 1). It implies that the majority of partition blocks have approximately the same length. Theorem 2 clarifies the limit distribution of these blocks. The techniques used can also be useful for deriving a range of analogous results. ©1997 Plenum Publishing Corporation.

Cite

CITATION STYLE

APA

Yakubovich, Y. (1997). Asymptotics of random partitions of a set. Journal of Mathematical Sciences, 87(6), 4124–4137. https://doi.org/10.1007/BF02355807

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free