SearcharxivSearch

arXiv · 2507.03700

Exponentially Fading Memory Signature

Abstract

We introduce the exponentially fading memory (EFM) signature, a time-invariant transformation of an infinite (possibly rough) path that serves as a mean-reverting analogue of the classical path signature. We construct the EFM-signature via rough path theory, carefully adapted to accommodate improper integration from minus infinity. The EFM-signature retains many of the key algebraic and analytical properties of classical signatures, including a suitably modified Chen identity, the linearization property, path-determinacy, and the universal approximation property. From the probabilistic perspective, the EFM-signature provides a "stationarized" representation, making it particularly well-suited for time-series analysis and signal processing overcoming the shortcomings of the standard signature. In particular, the EFM-signature of time-augmented Brownian motion evolves as a group-valued Ornstein-Uhlenbeck process. We establish its stationarity, Markov property, and exponential ergodicity in the Wasserstein distance, and we derive an explicit formula \`a la Fawcett for its expected value in terms of Magnus expansions. We also study linear combinations of EFM-signature elements and the computation of associated characteristic functions in terms of a mean-reverting infinite dimensional Riccati equation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eduardo Abi Jaber, Dimitri Sotnikov. 2025-07-04. Exponentially Fading Memory Signature. https://arxiv.org/abs/2507.03700

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