Journal article
Random Set Partitions
SIAM journal on discrete mathematics, v 7(3), pp 419-436
01 May 1994
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
For random partitions of $[ n ]$, let $L_n $ and $R_n $, respectively, denote the maximum block size and its multiplicity. The average multiplicity is $E( R_n ) = H( \{ m_n \} ) + o( 1 )$ as $n \to \infty $, where $H$ is an explicitly given analytic function and $\{ m_n \}$ is the fractional part of a certain implicitly defined root. The cumulative distribution function of $L_n $ also depends on $\{ m_n \}$. The sequence $\langle \{ m_n\}\rangle^{\infty}_{n=1}$ is dense in (0, 1). This establishes both the nonexistence of a limit distribution for $L_n $ and the nonexistence of a limiting value for $E( R_n )$.
Metrics
5 Record Views
Details
- Title
- Random Set Partitions
- Creators
- William M. Y GohEric Schmutz
- Publication Details
- SIAM journal on discrete mathematics, v 7(3), pp 419-436
- Publisher
- Society for Industrial and Applied Mathematics
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- [Retired Faculty]; Mathematics
- Web of Science ID
- WOS:A1994NY72600007
- Other Identifier
- 991019184314604721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Mathematics
- Mathematics, Applied