SearcharxivSearch

arXiv · 2504.11612

A generalized central limit theorem for critical marked Hawkes processes

Abstract

We prove a central limit type theorem for critical marked Hawkes processes. We study the case where the marks are i.i.d. with nonnegative values and their common distribution is either heavy tailed or has finite variance. The kernel function is of a multiplicative form and the mean number of future events triggered by a single event is $1$ (criticality). We also assume that the base intensity function is heavy tailed. We prove convergence in law in the space of tempered distributions of the normalized empirical measure corresponding to the times of events. We also study convergence in law in the Skorokhod space of the normalized event counting process as the time is speeded up. In case when the distribution of marks is heavy tailed, the limit process is a stable process with dependent increments, while in case of finite variance, the limit process is the same Gaussian process as for the non marked Hawkes process. We develop a new, robust method that may be applied to other self-exciting systems generalizing Hawkes processes. For example we consider a non marked self-exciting system where the number of excitations caused by single event is heavy tailed.

Explore related subjects

Keep this discovery

BibTeXRIS

Anna Talarczyk. 2025-04-15. A generalized central limit theorem for critical marked Hawkes processes. https://arxiv.org/abs/2504.11612

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