SearcharxivSearch

arXiv · 2404.18661

Restricted Path Characteristic Function Determines the Law of Stochastic Processes

Abstract

A central question in rough path theory is characterising the law of stochastic processes on path spaces. It is established in [I. Chevyrev & T. Lyons, Characteristic functions of measures on geometric rough paths, Ann. Probab. 44 (2016), 4049--4082] that the characteristic function of a probability measure on group-like elements, which is a subspace of the extended tensor algebra $\mathcal{T}\left(\mathbb{R}^d\right) = \prod_{n=0}^\infty\left(\mathbb{R}^d\right)^{\otimes n}$, uniquely determines the measure. In this work, we show that the characteristic function restricted to special orthogonal Lie algebra $\mathfrak{so}(n)$ is sufficient to achieve this goal. The key to our arguments is an explicit algorithm -- as opposed to the non-constructive approach in [I. Chevyrev & T. Lyons, op. cit.] -- for determining a generic element $X \in \mathcal{T}\left(\mathbb{R}^d\right)$ from its generating function when restricting its domain to a sparse subspace of real tridiagonal skew-symmetric matrices. Our only assumption is that $X$ has a non-zero ROC, which relaxes the condition of having an infinite ROC in the literature. As an application, we propose the restricted path characteristic function distance (RPCFD), a novel distance function for probability measures on the path space that serves as the sparse counterpart of path characteristic function distance. It has enormous advantages in dimension reduction and potential in generative modeling for synthetic time series generation, validated in this paper via hypothesis testing on fractional Brownian motions.

Explore related subjects

Keep this discovery

BibTeXRIS

Siran Li, Zijiu Lyu, Hao Ni, Jiajie Tao. 2024-04-29. Restricted Path Characteristic Function Determines the Law of Stochastic Processes. https://arxiv.org/abs/2404.18661

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