SearcharxivSearch

arXiv · 2609.10203

Moderate Deviations for Nonlinear Hawkes Processes

Abstract

A Hawkes process is a simple point process whose intensity depends on its history; the resulting dynamics are generally non-Markovian. We establish a sample-path moderate deviation principle for a nonlinear Hawkes process in the full moderate regime. Since a Poisson cluster representation is unavailable for nonlinear Hawkes processes, we use the past configuration as a Markov state and construct a potential, or Poisson corrector, for the centered stochastic intensity. A monotone Poisson coupling shows that the add-one increment of the corrector is uniformly bounded. The centered counting process is consequently the sum of a martingale with bounded jumps and an exponentially negligible boundary term. Exponential stabilization of the predictable quadratic variation follows from the process-level large deviation principle for nonlinear Hawkes processes. The martingale moderate deviation theorem then yields the result for every scale between the central-limit and large-deviation scales. The same construction gives a response formula for the asymptotic variance and, in particular, verifies that the variance dominates the stationary mean intensity in the self-exciting case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yingli Wang, Lingjiong Zhu. 2026-09-09. Moderate Deviations for Nonlinear Hawkes Processes. https://arxiv.org/abs/2609.10203

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