Search arXivSearch

arXiv · 2503.24136

Numerical simulation of Generalized Hermite Processes

Abstract

Hermite processes are paradigmatic examples of stochastic processes which can belong to any Wiener chaos of an arbitrary order; the wellknown fractional Brownian motion belonging to the Gaussian first order Wiener chaos and the Rosenblatt process belonging to the non-Gaussian second order Wiener chaos are two particular cases of them. Except these two particular cases no simulation method for sample paths of Hermite processes is available so far. The goal of our article is to introduce a new method which potentially allows to simulate sample paths of any Hermite process and even those of any generalized Hermite process. Our starting point is the representation for the latter process as random wavelet-typeseries, obtained in our very recent paper [3]. We construct from it a "concrete" sequence of piecewise linear continuous random functions which almost surely approximate sample paths of this process for the uniform norm on any compact interval, and we provide an almost sure estimate of the approximation error. Then, for the Rosenblatt process and more importantly for the third order Hermite process, we propose algorithms allowing to implement this sequence and we illustrate them by several simulations. Python routines implementing these synthesis procedures are available upon request.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine Ayache, Julien Hamonier, laurent Loosveldt. 2025-03-31. Numerical simulation of Generalized Hermite Processes. https://arxiv.org/abs/2503.24136

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR