Related papers: Central limit theorem analogues for multicolour ur…

We study the adjacency matrix of the Linial-Meshulam complex model, which is a higher-dimensional generalization of the Erd\H{o}s-R\'enyi graph model. Recently, Knowles and Rosenthal proved that the empirical spectral distribution of the…

This paper is devoted to a direct martingale approach for P{\'o}lya urn models asymptotic behaviour. A P{\'o}lya process is said to be small when the ratio of its remplacement matrix eigenvalues is less than or equal to 1/2, otherwise it is…

In this paper we are concerned with a family of $N$-urn branching processes, where some particles are put into $N$ urns initially and then each particle gives birth to several new particles in some urn when dies. This model includes the…

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 propose an elementary but effective approach to studying a general class of Poissonized tenable and balanced urns on two colors. We characterize the asymptotic behavior of the process via a partial differential equation that governs the…

Generalized Polya urn models can describe the dynamics of finite populations of interacting genotypes. Three basic questions these models can address are: Under what conditions does a population exhibit growth? On the event of growth, at…

We carry out the asymptotic analysis of repulsive ensembles of N particles which are discrete analogues of continuous 1d log-gases or beta-ensembles of random matrix theory. The ensembles that we study have several groups of particles which…

We propose an approach to analyze the asymptotic behavior of P\'olya urns based on the contraction method. For this, a new combinatorial discrete time embedding of the evolution of the urn into random rooted trees is developed. A…

Stochastic approximation algorithms have been the subject of an enormous body of literature, both theoretical and applied. Recently, Laruelle and Pag\`es (2013) presented a link between the stochastic approximation and response-adaptive…

The random self-reinforcement mechanism, characterized by the principle of ``the rich get richer'', has demonstrated significant utility across various domains. One prominent model embodying this mechanism is the random reinforcement urn…

We extend our recent result [Cipolloni, Erd\H{o}s, Schr\"oder 2019] on the central limit theorem for the linear eigenvalue statistics of non-Hermitian matrices $X$ with independent, identically distributed complex entries to the real…

We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.

Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…

A generalized Wigner matrix perturbed by a finite-rank deterministic matrix is considered. The fluctuations of the largest eigenvalues, which emerge outside the bulk of the spectrum, and the corresponding eigenvectors, are studied. Under…

We study fluctuations of linear statistics in Polyanalytic Ginibre ensembles, a family of point processes describing planar free fermions in a uniform magnetic field at higher Landau levels. Our main result is asymptotic normality of…

In this paper, we prove convergence and fluctuation results for measure-valued P\'olya processes (MVPPs, also known as P\'olya urns with infinitely-many colours). Our convergence results hold almost surely and in $L^2$, under assumptions…

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

We derive a central limit theorem for a spatial $\Lambda$-Fleming-Viot model with fluctuating population size. At each reproduction, a proportion of the population dies and is replaced by a not necessarily equal mass of new individuals. The…

We study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma…

We define and prove limit results for a class of dominant P\'olya sequences, which are randomly reinforced urn processes with color-specific random weights and unbounded number of possible colors. Under fairly mild assumptions on the…