相关论文: Exchangeable Gibbs partitions and Stirling triangl…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

A new type of stochastic dependence for a sequence of random variables is introduced and studied. Precisely, (X_n)_{n\geq 1} is said to be conditionally identically distributed (c.i.d.), with respect to a filtration (G_n)_{n\geq 0}, if it…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…

In inference problems involving a multi-dimensional parameter $\theta$, it is often natural to consider decision rules that have a risk which is invariant under some group $G$ of permutations of $\theta$. We show that this implies that the…

There is considerable current interest in the emergence of statistical correlations within a population of otherwise non-interacting Brownian particles subject to a common fluctuating environment or drive. Examples include global stochastic…

An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…

Asymptotic behaviour of conditional $\alpha$ diversity for the two-parameter Poisson-Dirichlet partition model and for the normalized generalized Gamma model has been recently investigated in Favaro et al. (2009, 2011) with a view to…

We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set…

Let $X_1,...,X_n$ be $n$ independent unbounded real random variables which have common, roughly speaking, light-tailed type distribution. Denote by $S_1^n$ their sum and by $\pi^{a_n}$ the tilted density of $X_1$, where $a_n…

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

This paper is concerned with the study of the random variable $K_n$ denoting the number of distinct elements in a random sample $(X_1, \dots, X_n)$ of exchangeable random variables driven by the two parameter Poisson-Dirichlet distribution,…

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

We consider the symmetric simple exclusion system on $\mathbb{Z}^d$, $d \ge 2$, starting from a class of ``step'' initial conditions in which particles are constrained within a half-space. One may count the number $N_t$ of particles that…

We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $\Pi$(t) of N into blocks of connected vertices.…

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…

The adhesive dynamics of a one-dimensional aggregating gas of point particles is rigorously described. The infinite hierarchy of kinetic equations for the distributions of clusters of nearest neighbours is shown to be equivalent to a system…