SearcharxivSearch

arXiv · 2110.10982

$\zeta$-functions and the topology of superlevel sets of stochastic processes

Abstract

We describe the topology of superlevel sets of ($\alpha$-stable) L\'evy processes X by introducing so-called stochastic $\zeta$-functions, which are defined in terms of the widely used $\text{Pers}_p$-functional in the theory of persistence modules. The latter share many of the properties commonly attributed to $\zeta$-functions in analytic number theory, among others, we show that for $\alpha$-stable processes, these (tail) $\zeta$-functions always admit a meromorphic extension to the entire complex plane with a single pole at $\alpha$, of known residue and that the analytic properties of these $\zeta$-functions are related to the asymptotic expansion of a dual variable, which counts the number of variations of X of size $\geq \varepsilon$. Using these results, we devise a new statistical parameter test using the topology of these superlevel sets. We further develop an analogous theory, whereby we consider the dual variable to be the number of points in the persistence diagram inside the rectangle $]\infty, x]\times[x+\varepsilon, \infty[$.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Perez. 2021-10-21. $\zeta$-functions and the topology of superlevel sets of stochastic processes. https://arxiv.org/abs/2110.10982

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