Related papers: Characterising random partitions by random colouri…
This paper introduces some new characterizations of COM-Poisson random variables. First, it extends Moran-Chatterji characterization and generalizes Rao-Rubin characterization of Poisson distribution to COM-Poisson distribution. Then, it…
A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random…
Using a probabilistic model, based on random walks on the additive group $\mathbb{Z}/m\mathbb{Z}$, we prove that the values of certain real character sums are uniformly distributed in residue classes modulo $m$.
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…
Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…
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.
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size $n.$ Our main results are formulas expressing the expected degree of graph nodes in…
Let $(S_k)_{k\ge 1}$ be the classical Bernoulli random walk on the integer line with jump parameters $p\in(0,1)$ and $q=1-p$. The probability distribution of the sojourn time of the walk in the set of non-negative integers up to a fixed…
It is known that large deviations of sums of subexponential random variables are most likely realised by deviations of a single random variable. In this article we give a detailed picture of how subexponential random variables are…
An "element-free" probability distribution is what remains of a probability distribution after we forget the elements to which the probabilities were assigned. These objects naturally arise in Bayesian statistics, in situations where…
We study a model of random partitioning by nearest-neighbor coloring from Poisson rain, introduced independently by Aldous and Preater. Given two initial points in $[0,1]^d$ respectively colored in red and blue, we let independent uniformly…
Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…
Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Using the LePage representation, a strictly stable random element in a Banach space with $\alpha\in(0,2)$ can be represented as a sum of points of a Poisson process. This point process is union-stable, i.e. the union of its two independent…
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…
The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
A popular approach for testing if two univariate random variables are statistically independent consists of partitioning the sample space into bins, and evaluating a test statistic on the binned data. The partition size matters, and the…
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…