AbstractWe consider central limit theory for urn models in which balls are not necessarily replaced after being drawn, giving rise to negative diagonal entries in the generating matrix. Under conditions on the eigenvalues and eigenvectors, we give results both for the contents of the urn and the number of times balls of each type are drawn
We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, ...
We study the infinite urn scheme when the balls are sequentially distributed over an infinite number...
AbstractAn urn contains balls of d≥2 colors. At each time n≥1, a ball is drawn and then replaced tog...
AbstractWe consider central limit theory for urn models in which balls are not necessarily replaced ...
We consider a general two-color urn model characterized by a 2x2 matrix of integerswithout constrain...
In this paper, we consider a two color multi-drawing urn model. At each discrete time step, we draw ...
The generalized P\uf2lya urn (GPU) models and their variants have been investigated in several disci...
AbstractA single urn model is considered for which, at each of a discrete set of time values, the ba...
AbstractThis work is devoted to the analysis of the area under certain lattice paths. The lattice pa...
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn ou...
We complete the study of the model introduced in a previous paper by the same authors. It is a two-c...
Consider the multicolored urn model where, after every draw, balls of the different colors are added...
This paper extends the link between stochastic approximation (SA) theory and randomized urn models d...
In this paper the authors continue to study the process of growth modeled by urn schemes containing ...
Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defin...
We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, ...
We study the infinite urn scheme when the balls are sequentially distributed over an infinite number...
AbstractAn urn contains balls of d≥2 colors. At each time n≥1, a ball is drawn and then replaced tog...
AbstractWe consider central limit theory for urn models in which balls are not necessarily replaced ...
We consider a general two-color urn model characterized by a 2x2 matrix of integerswithout constrain...
In this paper, we consider a two color multi-drawing urn model. At each discrete time step, we draw ...
The generalized P\uf2lya urn (GPU) models and their variants have been investigated in several disci...
AbstractA single urn model is considered for which, at each of a discrete set of time values, the ba...
AbstractThis work is devoted to the analysis of the area under certain lattice paths. The lattice pa...
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn ou...
We complete the study of the model introduced in a previous paper by the same authors. It is a two-c...
Consider the multicolored urn model where, after every draw, balls of the different colors are added...
This paper extends the link between stochastic approximation (SA) theory and randomized urn models d...
In this paper the authors continue to study the process of growth modeled by urn schemes containing ...
Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defin...
We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, ...
We study the infinite urn scheme when the balls are sequentially distributed over an infinite number...
AbstractAn urn contains balls of d≥2 colors. At each time n≥1, a ball is drawn and then replaced tog...
DOI
Add to ORKG