Searcharxiv⌕ Search

arXiv · 2609.38268

Learning the exogenous rate but not the distance to criticality in nearly unstable heavy-tailed Hawkes processes

Abstract

In the nearly unstable heavy-tailed regime of Jaisson and Rosenbaum, where the intensity of a linear Hawkes process converges to a rough square-root Volterra process, we ask what a record of length $T$ reveals about the relative distance to criticality $1-ρ$ and the exogenous rate $μ$. For the first, the information is governed by $\mathcal I_T=Tμ(1-ρ)$, not by the number of events; $\mathcal I_T$ stays bounded although the event count diverges like $T^{2γ}$, so no estimator of the relative distance to criticality is uniformly locally consistent. For the second, the Fisher information diverges because the rough limit has an atom at zero: the asymptotic information geometry is singular in the exogenous direction and, unlike the light-tailed case, has no Feller-type threshold. We prove that the joint maximum likelihood estimator of $(μ,ρ)$, whose likelihood is jointly concave, recovers $μ$ consistently at the random rate $\{Q_T/\log\log Q_T\}^{1/2}$ given by the observed information $Q_T$, while its estimate of the relative margin is only tight: the exogenous rate is learned although the endogenous parameter it is coupled to is not. For empty-start records $Q_T$ diverges because the rough limit started at zero spends positive time at zero; on windows observed long after the start, still with the branching ratio unknown, learnability holds with probability tending to one as the window grows, through the ergodicity of the rough limit and the atom of its stationary law. We also prove finite-dimensional convergence of the stationary intensity to the stationary rough Volterra process.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mauricio Herrera-Marín. 2026-09-29. Learning the exogenous rate but not the distance to criticality in nearly unstable heavy-tailed Hawkes processes. https://arxiv.org/abs/2609.38268

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↗