SearcharxivSearch

arXiv · 1207.4983

Stochastic integral representations and classification of sum- and max-infinitely divisible processes

Abstract

Introduced is the notion of minimality for spectral representations of sum- and max-infinitely divisible processes and it is shown that the minimal spectral representation on a Borel space exists and is unique. This fact is used to show that a stationary, stochastically continuous, sum- or max-i.d. random process on $\mathbb{R}^d$ can be generated by a measure-preserving flow on a $σ$-finite Borel measure space and that this flow is unique. This development makes it possible to extend the classification program of Rosiński (Ann. Probab. 23 (1995) 1163-1187) with a unified treatment of both sum- and max-infinitely divisible processes. As a particular case, a characterization of stationary, stochastically continuous, union-infinitely divisible random measurable subsets of $\mathbb{R}^d$ is obtained. Introduced and classified are several new max-i.d. random field models including fields of Penrose type and fields associated to Poisson line processes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zakhar Kabluchko, Stilian Stoev. 2016-01-15. Stochastic integral representations and classification of sum- and max-infinitely divisible processes. https://doi.org/10.3150/14-bej624

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