SearcharxivSearch

arXiv · 1410.2584

Random tessellations associated with max-stable random fields

Abstract

With any max-stable random process $η$ on $\mathcal{X}=\mathbb{Z}^d$ or $\mathbb{R}^d$, we associate a random tessellation of the parameter space $\mathcal{X}$. The construction relies on the Poisson point process representation of the max-stable process $η$ which is seen as the pointwise maximum of a random collection of functions $Φ=\{ϕ\_i, i\geq 1\}$. The tessellation is constructed as follows: two points $x,y\in \mathcal{X}$ are in the same cell if and only if there exists a function $ϕ\inΦ$ that realizes the maximum $η$ at both points $x$ and $y$, i.e. $ϕ(x)=η(x)$ and $ϕ(y)=η(y)$. We characterize the distribution of cells in terms of coverage and inclusion probabilities. Most interesting is the stationary case where the asymptotic properties of the cells are strongly related to the ergodic properties of the non-singular flow generating the max-stable process. For example, we show that: i) the cells are bounded almost surely if and only if $η$ is generated by a dissipative flow, ii) the cells have positive asymptotic density almost surely if and only if $η$ is generated by a positive flow.

Explore related subjects

Keep this discovery

BibTeXRIS

Clément Dombry, Z. Kabluchko. 2016-01-06. Random tessellations associated with max-stable random fields. https://arxiv.org/abs/1410.2584

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