相关论文: Integer Partitions and Exclusion Statistics
A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…
The k-body Gaussian Embedded Ensemble of Random Matrices is considered for N bosons distributed on two single-particle levels. When k = N, the ensemble is equivalent to the Gaussian Orthogonal Ensemble (GOE), and when k = 2 it corresponds…
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…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…
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…
Gibbs-type random probability measures and the exchangeable random partitions they induce represent the subject of a rich and active literature. They provide a probabilistic framework for a wide range of theoretical and applied problems…
Given a probability distribution $\mu$ a set $\Lambda (\mu)$ of positive real numbers is introduced, so that $\Lambda (\mu)$ measures the "divisibility" of $\mu$. The basic properties of $\Lambda (\mu)$ are described and examples of…
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.
In this paper we establish lower bounds on information divergence from a distribution to certain important classes of distributions as Gaussian, exponential, Gamma, Poisson, geometric, and binomial. These lower bounds are tight and for…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Along the line of thoughts of Berry and Robnik{\cite{Ber}}, the limiting gap distribution function of classically integrable quantum systems is derived in the limit of infinitely many independent components. The limiting gap distribution…
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…
We describe an approach that allows us to deduce the limiting return times distribution for arbitrary sets to be compound Poisson distributed. We establish a relation between the limiting return times distribution and the probability of the…
The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…
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…
In this paper we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions to tackle this…
We consider the asymmetric simple exclusion process confined to the nonnegative integers with an open boundary at 0. The point 0 is connected to a reservoir where particles are injected and ejected at prescribed rates subject to the…