Related papers: On generalized P\'olya urn models
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…
We propose a variant model of P{\'o}lya urn process, where the dynamics consist of two competing elements namely, suppression of growth and enhancement of dormant character. Here the level of such features are controlled by an internal…
We consider a random trial-based telegraph process, which describes a motion on the real line with two constant velocities along opposite directions. At each epoch of the underlying counting process the new velocity is determined by the…
We consider predictive inference using a class of temporally dependent Dirichlet processes driven by Fleming--Viot diffusions, which have a natural bearing in Bayesian nonparametrics and lend the resulting family of random probability…
The Generalized P\'{o}lya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential…
We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.
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…
A new class of one-dimensional, discrete time random walk model with memory, termed "Random walk with $n$ memory channels" (RW$n$MC) is proposed. In this model the information of $n$ ($n\in \mathbb{Z}$) previous steps from the walker's…
Several differential equations usually appearing in mathematical physics are solved through a power series expansion, which reduces in solving difference equations. In this paper a probability problem is presented whose solution follows a…
This is a technical note which extends the results of Kosygina, Mountford and Peterson (Ann. Probab., 51(5):1684-1728, 2023, Section 4) about generalized P\'olya's urns from a specific weight function $w(n) = (n+1)^{-\alpha}$ to a general…
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…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
We consider a randomized urn model with objects of finitely many colors. The replacement matrices are random, and are conditionally independent of the color chosen given the past. Further, the conditional expectations of the replacement…
In this study, we analyzed urn models by solving the discrete-time master equation using an expansion in moments. This approach is a viable alternative to conventional methods, such as system-size expansion, allowing for the determination…
Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…
We introduce an urn model which describes spatial separation of sand. In this dynamical model, in a certain range of parameters spontaneous symmetry breaking takes place and equipartitioning of sand into two compartments is broken. The…
We consider the urn setting with two different objects, ``good'' and ``bad'', and analyze the number of draws without replacement until a good object is picked. Although the expected number of draws for this setting is a standard textbook…
The wide availability of biological data at the genome-scale and across multiple variables has resulted in statistical questions regarding the enrichment or depletion of the number of discrete objects (e.g. genes) identified in individual…
We present an elementary non-recursive formula for the multivariate moments of the Dirichlet distribution on the standard simplex, in terms of the pattern inventory of the moments' exponents. We obtain analog formulas for the multivariate…
We introduce a new model for contagion spread using a network of interacting finite memory two-color P\'{o}lya urns, which we refer to as the finite memory interacting P\'{o}lya contagion network. The urns interact in the sense that the…