Search arXivSearch

arXiv · 1407.5043

Fluctuation Theorems for Synchronization of Interacting Polya's urns

Abstract

We consider a model of N two-colors urns in which the reinforcement of each urn depends also on the content of all the other urns. This interaction is of mean-field type and it is tuned by a parameter $α$ in [0,1]; in particular, for $α=0$ the N urns behave as N independent Polya's urns. As shown in [9], for $α>0$ urns synchronize, in the sense that the fraction of balls of a given color converges a.s. to the same (random) limit in all urns. In this paper we study fluctuations around this synchronized regime. The scaling of these fluctuations depends on the parameter $α$. In particular the standard scaling $t^{-1/2}$ appears only for $α>1/2$. For $α\geq 1/2$ we also determine the limit distribution of the rescaled fluctuations. We use the notion of stable convergence, which is stronger than convergence in distribution.

Explore related subjects

Keep this discovery

BibTeXRIS

Irene Crimaldi, Paolo Dai Pra, Ida Germana Minelli. 2015-03-19. Fluctuation Theorems for Synchronization of Interacting Polya's urns. https://arxiv.org/abs/1407.5043

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