Related papers: Increments of Random Partitions

The Generalized Chinese Restaurant Process (GCRP) describes a sequence of exchangeable random partitions of the numbers $\{1,\dots,n\}$. This process is related to the Ewens sampling model in Genetics and to Bayesian nonparametric methods…

Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wide applicability in model-based clustering, population…

We consider procedures of sampling parts from a random integer partition. We determine asymptotically the probabilty distribution of the randomly-selected part whenever the positive integer that is partitioned becomes large.

Let $(X_1,X_2,...)$ be a random partition of the unit interval $[0,1]$, i.e. $X_i\geq0$ and $\sum_{i\geq1} X_i=1$, and let $(\varepsilon_1,\varepsilon_2,...)$ be i.i.d. Bernoulli random variables of parameter $p \in (0,1)$. The Bernoulli…

For two collections of nonnegative and suitably normalised weights $\W=(\W_j)$ and $\V=(\V_{n,k})$, a probability distribution on the set of partitions of the set $\{1,...,n\}$ is defined by assigning to a generic partition $\{A_j, j\leq…

By resorting to sequential constructions of exchangeable random partitions (Pitman, 2006), and exploiting some known facts about generalized Stirling numbers, we derive a generalized Chinese restaurant process construction of exchangeable…

The Chinese restaurant process is a basic sequential construction of consistent random partitions. We consider random point measures describing the composition of small blocks in such partitions and show that their scaling limit is given by…

We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations. These distributions…

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…

Let $\lambda$ be a partition of the positive integer $n$ chosen umiformly at random among all such partitions. Let $L_n=L_n(\lambda)$ and $M_n=M_n(\lambda)$ be the largest part size and its multiplicity, respectively. For large $n$, we…

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

We present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…

Multisets are like sets, except that they can contain multiple copies of their elements. If there are $n_i$ copies of $i$, $1\leq i\leq t$, in multiset $M_t$, then there are $\binom{n_1+\cdots+n_t}{n_1,\ldots, n_t}$ possible permutations of…

We establish scaling limit theorems for the up-down ordered Chinese restaurant processes (oCRPs) of Rogers and Winkel as processes in a space of interval partitions. As previously conjectured, the limits are self-similar diffusions…

We consider shifts $\Pi_{n,m}$ of a partially exchangeable random partition $\Pi_\infty$ of $\mathbb{N}$ obtained by restricting $\Pi_\infty$ to $\{n+1,n+2,\dots, n+m\}$ and then subtracting $n$ from each element to get a partition of…

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…