SearcharxivSearch

arXiv · 1407.7888

Occupation times of long-range exclusion and connections to KPZ class exponents

Abstract

With respect to a class of long-range exclusion processes on $\mathbb{Z}^d$, with single particle transition rates of order $|\cdot|^{-(d+α)}$, starting under Bernoulli invariant measure $ν_ρ$ with density $ρ$, we consider the fluctuation behavior of occupation times at a vertex and more general additive functionals. Part of our motivation is to investigate the dependence on $α$, $d$ and $ρ$ with respect to the variance of these functionals and associated scaling limits. In the case the rates are symmetric, among other results, we find the scaling limits exhaust a range of fractional Brownian motions with Hurst parameter $H\in [1/2,3/4]$. However, in the asymmetric case, we study the asymptotics of the variances, which when $d=1$ and $ρ=1/2$ points to a curious dichotomy between long-range strength parameters $0<α\leq 3/2$ and $α>3/2$. In the former case, the order of the occupation time variance is the same as under the process with symmetrized transition rates, which are calculated exactly. In the latter situation, we provide consistent lower and upper bounds and other motivations that this variance order is the same as under the asymmetric short-range model, which is connected to KPZ class scalings of the space-time bulk mass density fluctuations.

Explore related subjects

Keep this discovery

BibTeXRIS

Cédric Bernardin, Patrícia Gonçalves, Sunder Sethuraman. 2014-07-29. Occupation times of long-range exclusion and connections to KPZ class exponents. https://arxiv.org/abs/1407.7888

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