相关论文: Periodic P\'olya urns and an application to Young …

A cyclic urn is an urn model for balls of types $0,\ldots,m-1$ where in each draw the ball drawn, say of type $j$, is returned to the urn together with a new ball of type $j+1 \mod m$. The case $m=2$ is the well-known Friedman urn. The…

Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…

This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…

We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.

We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…

We consider a generalization of the Bernoulli-Laplace model in which there are two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and where the left urn holds $m$ balls. At each time increment, $k$ balls are chosen…

Generalized probability distributions for Maxwell-Boltzmann, Bose-Einstein and Fermi-Dirac statistics, with unequal source probabilities $q_i$ for each level $i$, are obtained by combinatorial reasoning. For equiprobable degenerate…

An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…

We study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labelled 1,2,... so that the urn $j$ at every draw gets a ball with probability $p_j$, $\sum_j p_j=1$. We prove functional central…

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…

We propose a definition for the P\'olya number of continuous-time quantum walks to characterize their recurrence properties. The definition involves a series of measurements on the system, each carried out on a different member from an…

Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…

We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…

The concept of time emerges as an ordering structure in a classical statistical ensemble. Probability distributions $p_\tau(t)$ at a given time $t$ obtain by integrating out the past and future. We discuss all-time probability distributions…

Measure-valued P\'olya urn sequences (MVPS) are a generalization of the observation processes generated by $k$-color P\'olya urn models, where the space of colors $\mathbb{X}$ is a complete separable metric space and the urn composition is…

We consider a system of urns of Polya-type, with balls of two colors; the reinforcement of each urn depends both on the content of the same urn and on the average content of all urns. We show that the urns synchronize almost surely, in the…

We introduce and discuss a special type of feedback interacting urn model with deterministic interaction. This is a generalisation of the very well known Eggenberger and Polya (1923) urn model. In our model, balls are added to a particular…

A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…

Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…

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…