SearcharxivSearch

arXiv · 2007.05918

Second Time Scale of the Metastability of Reversible Inclusion Processes

Abstract

We investigate the second time scale of the metastable behavior of the reversible inclusion process in an extension of the study by [Bianchi, Dommers, and Giardin\`a, Electronic Journal of Probability, 22: 1-34, 2017], which presented the first time scale of the same model and conjectured the scheme of multiple time scales. We show that $N/d_{N}^{2}$ is indeed the correct second time scale for the most general class of reversible inclusion processes, and thus prove the first conjecture of the foresaid study. Here, $N$ denotes the number of particles, and $d_{N}$ denotes the small scale of randomness of the system. The main obstacles of this research arise in calculating the sharp asymptotics for the capacities, and in the fact that the methods employed in the former study are not directly applicable due to the complex geometry of particle configurations. To overcome these problems, we first thoroughly examine the landscape of the transition rates to obtain a proper test function of the equilibrium potential, which provides the upper bound for the capacities. Then, we modify the induced test flow and precisely estimate the equilibrium potential near the metastable valleys to obtain the correct lower bound for the capacities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seonwoo Kim. 2020-07-12. Second Time Scale of the Metastability of Reversible Inclusion Processes. https://arxiv.org/abs/2007.05918

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