Related papers: Sampling Part Sizes of Random Integer Partitions
A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from…
We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…
Rejection sampling is a popular method used to generate numbers that follow some given distribution. We study the use of this method to generate random numbers in the unit interval from increasing probability density functions. We focus on…
We study large partial sums, localized with respect to the sums of variances, of a sequence of centered random variables. An application is given to the distribution of prime factors of typical integers.
The norm of an integer partition is defined as the product of its parts. This statistic was recently introduced by Schneider in connection to partition zeta functions. In this note, we use the method of moments to study the distribution of…
The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal.
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…
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…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
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…
Given an integer partition of $n$ into distinct parts, the sum of the reciprocal parts is an example of an egyptian fraction. We study this statistic under the uniform measure on distinct parts partitions of $n$ and prove that, as $n \to…
In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…
When a beneficial mutation occurs in a population, the new, favored allele may spread to the entire population. This process is known as a selective sweep. Suppose we sample $n$ individuals at the end of a selective sweep. If we focus on a…
These are extended notes for my talk at the ICMP 2003 in Lisbon. Our goal here is to demonstrate how natural and fundamental random partitions are from many different points of view. We discuss various natural measures on partitions, their…