SearcharxivSearch

arXiv · 2406.15006

Tails of explosive birth processes and applications to non-linear P \'{o}lya urns

Abstract

We derive a simple expression for the tail-asymptotics of an explosive birth process at a fixed observation time conditioned on non-explosion. Using the well-established exponential embedding, we apply this result to compute the tail distribution of the number of balls of a losing colour in generalized P \'{o}lya urn models with super-linear feedback, which are known to exhibit a strong monopoly for the winning colour where losers only win a finite amount. Previous results in this direction were restricted to two colours with the same feedback, which we extend to an arbitrary finite number of colours with individual feedback mechanisms. As an apparent paradox, losing colours with weak feedback are more likely to win in many steps than those with strong feedback. Our approach also allows to characterize the correlations of several losing colours, which provides new insight in the distribution of other related quantities like the total number of balls for losing colours or the time to monopoly. In order to give a complete picture, we also consider sub-linear feedback and discuss asymptotics for a diverging number of colours.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Gottfried, Stefan Grosskinsky. 2024-06-21. Tails of explosive birth processes and applications to non-linear P \'{o}lya urns. https://arxiv.org/abs/2406.15006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR