SearcharxivSearch

arXiv · 1907.00446

Limit theorems for integrated trawl processes with symmetric L\'evy bases

Abstract

We study long time behavior of integrated trawl processes introduced by Barndorff-Nielsen. The trawl processes form a class of stationary infinitely divisible processes, described by an infinitely divisible random measure (L\'evy base) and a family of shifts of a fixed set (trawl). We assume that the L\'evy base is symmetric and homogeneous and that the trawl set is determined by the trawl function that decays slowly. Depending on the geometry of the trawl set and on the L\'evy measure corresponding to the L\'evy base we obtain various types of limits in law of the normalized integrated trawl processes for large times. The limit processes are always stable and self-similar with stationary increments. In some cases they have independent increments - they are stable L\'evy processes where the index of stability depends on the parameters of the model. We show that stable limits with stability index smaller than 2 may appear even in cases when the underlying L\'evy base has all its moments finite. In other cases, the limit process has dependent increments and it may be considered as a new extension of fractional Brownian motion to the class of stable processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Anna Talarczyk, Łukasz Treszczotko. 2019-06-30. Limit theorems for integrated trawl processes with symmetric L\'evy bases. https://doi.org/10.1214/20-ejp509

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