Searcharxiv⌕ Search

arXiv · 2609.12321

Expected Infimum and persistence probabilities of Log-Normal Stationary Brown-Resnick Processes

Abstract

We investigate the asymptotics of the expected infimum of log-normal Brown-Resnick stationary processes, a class of processes that arise naturally in the study of extremes of Gaussian processes and max-stable processes. Specifically, we analyse the functional $$\mathcal{G}_V(T) = \mathbb{E}\left\{\inf_{t \in [0,T]}e^{ \sqrt{2}V(t)-σ^2_V(t)} \right\}, \quad T>0, $$ where $V$ is a centered Gaussian process with stationary increments, continuous sample paths and variance $σ_V^2$, and a closely related problem of the decay rate of the persistence probability $$p_V(T,C)=\mathbb{P}\left\{\inf_{t\in [0,T]} (\sqrt{2} V(t)- σ^2_V(t)) > C\right\}$$ for some constant $C<0$. For both $\mathcal{G}_V(T)$ and $p_V(T,C)$ we derive exact asymptotics as $T \to \infty$ for a broad class of processes $V$, including fractional Brownian motion with Hurst parameter $H \in (1/2,1]$. For the latter, the behavior in the short-range dependence regime $H \in (0, 1/2]$ is markedly different and, in general, more delicate; we find logarithmic asymptotics for a family of processes that includes this case. Our results provide sharp bounds and comparison principles, and highlight the contrast between the behavior of infimum and supremum functionals for such processes. The discrete-time analogues and connections to Pickands constants are also discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof Dȩbicki, Enkelejd Hashorva, Svyatoslav Novikov. 2026-09-11. Expected Infimum and persistence probabilities of Log-Normal Stationary Brown-Resnick Processes. https://arxiv.org/abs/2609.12321

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

KEEP EXPLORING

Related papers

Dark Subspaces and Invariant Measures of Quantum Trajectories

Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non identically distributed random matrices. In this article, we establish a complete classification of their invariant measures. The classification is done in two steps. First, we prove a Markov process on some linear subspaces called dark subspaces, defined in (Maassen, Kümmerer 2006), admits a unique invariant measure. Second, we study the process inside the dark subspaces. Using a notion of minimal family of isometries from a reference space to dark subspaces, we prove a set of measures indexed by orbits of a unitary group is the set of ergodic measures of quantum trajectories.

math.PR↗

Expected Signature Kernels for Rough Paths

The expected signature kernel is a similarity measure of probability laws on path space and enters directly into signature maximum mean discrepancies. Building on [P. K. Friz, P. P. Hager, and N. Tapia, Forum Math. Sigma, 10 (2022), e42] and [M. Lemercier, T. Lyons, and C. Salvi, SIAM J. Numer. Anal., 64 (2026), pp. 1095-1125], we characterize the expected signature kernel of group-valued inhomogeneous Lévy processes, aka Lévy rough paths, as the scalar component of the solution to an extended Goursat-type system. We give an original description, first in the continuous case where the finite-dimensional system is exact. In the presence of jumps, this system is inherently infinite-dimensional; we prove its well-posedness and derive finite-dimensional truncations with explicit error control. This permits direct evaluation of the reference-dependent terms in one-sample signature-MMD tests without an auxiliary reference sample. Finally, for conditionally Gaussian martingales, conditioning the usual unbiased empirical squared signature-MMD on the sampled quadratic variations yields an unbiased statistic for the same quantity with no larger variance. We derive computable finite-grid versions and illustrate the resulting variance reduction and gain in power.

math.PR↗

A central limit theorem for the range of random walk indexed by an infinite tree

We are interested in the second-order fluctuations of the size of the range of a random walk indexed by an infinite tree in ${\mathbb Z}^d$. Consider the Kesten tree with geometric offspring, we view the vertices on the left of its spine (the unique infinite path) as the past, and those on the right as the future. We show that the number of new sites in the future given its past has linear variance when $d>8$, and satisfies a central limit theorem (CLT) with Gaussian limiting distribution when $d>16$. The proof relies on the stationarity of the model under depth-first exploration, a general CLT by Dedecker and Merlevède [7], a truncation technique exploiting the local independence of tree structures, and a recursion argument for moment bounds.

math.PR↗