RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 1995 Volume 223, Pages 227–250 (Mi znsl4389)

This article is cited in 4 papers

Combinatorial and algorithmic methods

Asymptotics of random partitions of a set

Yu. V. Yakubovich

Saint-Petersburg State University

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 $\delta$-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. Bibliography: 13 titles.

UDC: 519.217

Received: 15.01.1995


 English version:
Journal of Mathematical Sciences (New York), 1997, 87:6, 4124–4137

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025