Related papers: Exactly Solvable Balanced Tenable Urns with Random…
We give bounds for (central) moments for balanced P\'olya urns under very general conditions. In some cases, these bounds imply that moment convergence holds in earlier known results on asymptotic distribution. The results overlap with…
We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded. Binary or non-negative integer…
In a recent paper, the authors studied the distribution properties of a class of exchangeable processes, called measure-valued P\'{o}lya sequences (MVPS), which arise as the observation process in a generalized urn sampling scheme. Here we…
The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…
This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules…
We described a method to solve deterministic and stochastic Walras equilibrium models based on associating with the given problem a bifunction whose maxinf-points turn out to be equilibrium points. The numerical procedure relies on an…
In this paper, we prove functional limit theorems for P\'olya urn processes whose number of draws and initial number of balls tend to infinity together. This is motivated by recent work of Borovkov [5], where they prove a functional limit…
P\'{o}lya urn is a stochastic process in which balls are randomly drawn from an urn of red and blue balls, and balls of the same color as the drawn balls are added. The probability of a ball of a certain color being drawn is equal to the…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
We consider a version of the classical P\'olya urn scheme which incorporates innovations. The space $S$ of colors is an arbitrary measurable set. After each sampling of a ball in the urn, one returns $C$ balls of the same color and…
We introduce a method to sample the orientational distribution function in computer simulations. The method is based on the exact torque balance equation for classical many-body systems of interacting anisotropic particles in equilibrium.…
Normalizing flows are exact-likelihood generative neural networks which approximately transform samples from a simple prior distribution to samples of the probability distribution of interest. Recent work showed that such generative models…
This study analyzes pass networks in football (soccer) using a stochastic model known as the P\'olya urn. By focusing on preferential selection, it theoretically demonstrates that the time evolution of networks can be characterized by a…
We consider a mean-field dynamical urn model, defined by rules which give the rate at which a ball is drawn from an urn and put in another one, chosen amongst an assembly. At equilibrium, this model possesses a fluid and a condensed phase,…
Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…
Evolving networks with a constant number of edges may be modelled using a rewiring process. These models are used to describe many real-world processes including the evolution of cultural artifacts such as family names, the evolution of…
Polya Enumeration Theorem is one of the most useful tools dealing with the enumeration of patterns that are symmetric in some ways. What follows is a procedure for obtaining the results of Polya Theorem directly, bypassing the usual…
The availability of high-throughput parallel methods for sequencing microbial communities is increasing our knowledge of the microbial world at an unprecedented rate. Though most attention has focused on determining lower-bounds on the…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…