Search arXiv⌕ 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

Multiple SLEs and Dyson Brownian motion: transition density and Green's function

We consider multiple chordal Schramm-Loewner evolution (SLE) with $κ\in (0,4]$. Under common-time parameterization, we show that the transition density of the driving function of multiple chordal SLEs can be given by the transition density of Dyson Brownian motion and Green's function. This is a companion paper of [FWY24].

math.PR↗

Asymptotics of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit

We study the distribution of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit. For any unimodular Euclidean lattice and any smooth initial velocity distribution, we establish an asymptotic formula for the distribution function of the free path length with a polynomial rate of convergence. The proof combines the dynamical interpretation of the free path length in terms of expanding translates of horospherical orbits on the space of affine lattices, due to Marklof--Strömbergsson, with the effective equidistribution results of Kleinbock--Margulis and Kim. This extends the asymptotic formula of Boca--Zaharescu for the planar case to arbitrary dimension.

math.PR↗

The smallest singular value for rectangular random matrices with Lévy entries

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $σ_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that $n^{-\frac{1}{2}}σ_{min}(X)$ converges almost surely to $\sqrt{\mathbf{a}}-1.$ However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying $\mathbb{P}(|x_{ij}|>t)\asymp t^{-α}$ for some $α\in(0,2)$, and prove that $σ_{min}(X)$ can be determined up to a log factor with high probability: for any $D>0$, with probability at least $1-n^{-D}$ we have $$C_1n^{\frac{1}α}(\log n)^\frac{2(α-2)}α\leq σ_{min}(X)\leq C_2n^{\frac{1}α}(\log n)^\frac{α-2}{2α}$$ for some constants $C_1,C_2>0$. The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of $σ_{min}(X)$ in the $α$-stable case with a correct leading order of $n$, as previous anti-concentration arguments only yield lower bound $n^\frac{1}{2}$. The same lower bound holds for $σ_{min}(X+B)$ for any fixed rectangular matrix $B$ with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

math.PR↗