SearcharxivSearch

arXiv · 0804.2585

On the orthogonal polynomials associated with a Lévy process

Abstract

Let $X=\{X_t, t\ge0\}$ be a càdlàg Lévy process, centered, with moments of all orders. There are two families of orthogonal polynomials associated with $X$. On one hand, the Kailath--Segall formula gives the relationship between the iterated integrals and the variations of order $n$ of $X$, and defines a family of polynomials $P_1(x_1), P_2(x_1,x_2),...$ that are orthogonal with respect to the joint law of the variations of $X$. On the other hand, we can construct a sequence of orthogonal polynomials $p^σ_n(x)$ with respect to the measure $σ^2δ_0(dx)+x^2 ν(dx)$, where $σ^2$ is the variance of the Gaussian part of $X$ and $ν$ its Lévy measure. These polynomials are the building blocks of a kind of chaotic representation of the square functionals of the Lévy process proved by Nualart and Schoutens. The main objective of this work is to study the probabilistic properties and the relationship of the two families of polynomials. In particular, the Lévy processes such that the associated polynomials $P_n(x_1,...,x_n)$ depend on a fixed number of variables are characterized. Also, we give a sequence of Lévy processes that converge in the Skorohod topology to $X$, such that all variations and iterated integrals of the sequence converge to the variations and iterated integrals of $X$.

Explore related subjects

Keep this discovery

BibTeXRIS

Josep Lluís Solé, Frederic Utzet. 2008-04-16. On the orthogonal polynomials associated with a Lévy process. https://doi.org/10.1214/07-aop343

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