Related papers: Random partitions with non negative rth difference…

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

Efficient and accurate estimation of multivariate empirical probability distributions is fundamental to the calculation of information-theoretic measures such as mutual information and transfer entropy. Common techniques include variations…

In this paper, we consider plane partitions $\text{PP}(\lambda; m)$ of a given shape $\lambda$, with entries at most $m$. We prove that the distributions of two statistics on $\text{PP}(\lambda; m)$ coincide: one is the number of rows…

We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…

Probability estimation is an elementary building block of every statistical data compression algorithm. In practice probability estimation is often based on relative letter frequencies which get scaled down, when their sum is too large.…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

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…

We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors…

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

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…

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

We consider \emph{random linear programs} (rlps) as a subclass of \emph{random optimization problems} (rops) and study their typical behavior. Our particular focus is on appropriate linear objectives which connect the rlps to the mean…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…