Related papers: Moment convergence of balanced P\'olya processes
We establish the convergences (with respect to the simulation time $t$; the number of particles $N$; the timestep $\gamma$) of a Moran/Fleming-Viot type particle scheme toward the quasi-stationary distribution of a diffusion on the…
We consider an ordinary differential equation with a unique hyperbolic attractor at the origin, to which we add a small random perturbation. It is known that under general conditions, the solution of this stochastic differential equation…
After reviewing the general scaling properties of aging systems, we present a numerical study of the slow evolution induced in the zeta urn model by a quench from a high temperature to a lower one where a condensed equilibrium phase exists.…
We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector $(X,Y)$ is asymptotically normal whenever $Y$ is not almost surely constant. No further conditions on the joint…
We consider consistent particle systems, which include independent random walkers, the symmetric exclusion and inclusion processes, as well as the dual of the KMP model. Consistent systems are such that the distribution obtained by first…
Almost surely in an Angelesco ensemble,the normalized counting measure of a random point converges weak* to the equilibrium measure.This result, for orthogonal polynomial ensembles, is well-known.
Convergence results for averages of independent replications of counting processes are established in a $p$-variation setting and under certain assumptions. Such convergence results can be combined with functional differentiability results…
A classical P\'olya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in…
We consider systems of interacting Generalized Friedman's Urns (GFUs) having irreducible mean replacement matrices. The interaction is modeled through the probability to sample the colors from each urn, that is defined as convex combination…
Consider a branching Markov process, $X = (X(t), t \ge 0)$, with non-local branching mechanism. Studying the asymptotic behaviour of the moments of X has recently received attention in the literature [6, 7] due to the importance of these…
We study the boundedness and convergence to equilibrium of weak solutions to reaction-diffusion systems with nonlinear diffusion. The nonlinear diffusion is of porous medium type and the nonlinear reaction terms are assumed to grow…
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…
Studying the subexponential convergence towards equilibrium of a strong Markov process, we exhibit an intermediate Lyapunov condition equivalent to the control of some moment of a hitting time. This provides a link, similar (although more…
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…
The equilibrium measure of a compact plane set gives the steady state distribution of charges on the conductor. We show that certain moments of this equilibrium measure, when taken about the electrostatic centroid and depending only on the…
Consider a number, finite or not, of urns each with fixed capacity $r$ and balls randomly distributed among them. An overflow is the number of balls that are assigned to urns that already contain $r$ balls. When $r=1$, using analytic…
Consider a P\'olya urn where a drawn ball of colour $i$ is replaced together with a fixed number $m_i$ of balls of the same colour. We give a simple proof that if, for example, there are two colours and the urn starts with more balls of…
In this paper, we establish smoothness of moments of the solutions of discrete coagulation-diffusion systems. As key assumptions, we suppose that the coagulation coefficients grow at most sub-linearly and that the diffusion coefficients…
In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…