Search arXivSearch

arXiv · 1504.04891

Invariance principles for operator-scaling Gaussian random fields

Abstract

Recently, Hammond and Sheffield introduced a model of correlated random walks that scale to fractional Brownian motions with long-range dependence. In this paper, we consider a natural generalization of this model to dimension $d\geq 2$. We define a $\mathbb Z^d$-indexed random field with dependence relations governed by an underlying random graph with vertices $\mathbb Z^d$, and we study the scaling limits of the partial sums of the random field over rectangular sets. An interesting phenomenon appears: depending on how fast the rectangular sets increase along different directions, different random fields arise in the limit. In particular, there is a critical regime where the limit random field is operator-scaling and inherits the full dependence structure of the discrete model, whereas in other regimes the limit random fields have at least one direction that has either invariant or independent increments, no longer reflecting the dependence structure in the discrete model. The limit random fields form a general class of operator-scaling Gaussian random fields. Their increments and path properties are investigated.

Explore related subjects

Keep this discovery

BibTeXRIS

Hermine Biermé, Olivier Durieu, Yizao Wang. 2015-04-19. Invariance principles for operator-scaling Gaussian random fields. https://arxiv.org/abs/1504.04891

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