SearcharxivSearch

arXiv · 1608.03887

Stable random fields indexed by finitely generated free groups

Abstract

In this work, we investigate the extremal behaviour of left-stationary symmetric $\alpha$-stable (S$\alpha$S) random fields indexed by finitely generated free groups. We begin by studying the rate of growth of a sequence of partial maxima obtained by varying the indexing parameter of the field over balls of increasing size. This leads to a phase-transition that depends on the ergodic properties of the underlying nonsingular action of the free group but is different from what happens in the case of S$\alpha$S random fields indexed by $\mathbb{Z}^d$. The presence of this new dichotomy is confirmed by the study of a stable random field induced by the canonical action of the free group on its Furstenberg-Poisson boundary with the measure being Patterson-Sullivan. This field is generated by a conservative action but its maxima sequence grows as fast as the i.i.d. case contrary to what happens in the case of $\mathbb{Z}^d$. When the action of the free group is dissipative, we also establish that the scaled extremal point process sequence converges weakly to a novel class of point processes that we have termed as randomly thinned cluster Poisson processes. This limit too is very different from that in the case of a lattice.

Explore related subjects

Keep this discovery

BibTeXRIS

Sourav Sarkar, Parthanil Roy. 2016-08-12. Stable random fields indexed by finitely generated free groups. https://arxiv.org/abs/1608.03887

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