Interacting Hawkes processes are counting processes whose intensities depend on historical events via excitation kernels, network weights, and auxiliary state variables.
They integrate random graph formulations, age-dependent dynamics, and state-dependent feedback to capture complex interactions in neural and social systems.
The framework offers rigorous well-posedness, propagation of chaos, and long-time asymptotic results that support practical high-dimensional inference and simulation.
Searching arXiv for recent and foundational papers on interacting Hawkes processes.
Interacting Hawkes processes are systems of counting processes in which the predictable intensity of each component depends on the past of other components through excitation kernels, network weights, and, in many variants, auxiliary state variables such as age, membrane potential, or latent ancestor labels. In the graph-based formulation of Delattre, Fournier and Hoffmann, each node i has intensity
λti=μi+j→i∑∫0t−hij(t−s)dZsj,
while later work replaces the complete graph by random possibly diluted and inhomogeneous graphs, introduces age-dependent and variable-length memory mechanisms, and allows state-dependent or ancestor-dependent excitation (Delattre et al., 2014, Agathe-Nerine, 2021, Chevallier, 2015, Ross et al., 4 May 2026). The subject therefore lies at the intersection of interacting particle systems, point-process theory, graph limits, renewal equations, stochastic PDE limits, and high-dimensional statistical inference.
1. Network formulations and model classes
A standard construction uses independent Poisson random measures and thinning. On a directed graph G=(S,E), a Hawkes process with parameters (G,μ,h) is defined by
This formulation already permits countably many interacting components and nearest-neighbour interaction structures on Zd (Delattre et al., 2014).
Random-graph formulations introduce spatial positions and inhomogeneous connectivity. In the model of neurons located at x1,…,xN∈I⊂Rd, one draws independent Bernoulli adjacency variables
Here f may be linear, λti=μi+j→i∑∫0t−hij(t−s)dZsj,0, or a general Lipschitz nonnegative function; λti=μi+j→i∑∫0t−hij(t−s)dZsj,1 is the synaptic memory kernel; and λti=μi+j→i∑∫0t−hij(t−s)dZsj,2 is a bounded continuous baseline drive (Agathe-Nerine, 2021).
Mean-field age-dependent models add the predictable age
λti=μi+j→i∑∫0t−hij(t−s)dZsj,3
to the intensity map. In the Age-Dependent Random Hawkes Process of Chevallier and collaborators, the rate is
λti=μi+j→i∑∫0t−hij(t−s)dZsj,4
so the process depends simultaneously on time since the last event and on the interaction field generated by the population (Chevallier, 2015).
The state-dependent generalization of Morariu-Patrichi and Pakkanen places the process on a product mark space λti=μi+j→i∑∫0t−hij(t−s)dZsj,5, with marks λti=μi+j→i∑∫0t−hij(t−s)dZsj,6, and uses the product-form intensity
λti=μi+j→i∑∫0t−hij(t−s)dZsj,7
A common special case is
λti=μi+j→i∑∫0t−hij(t−s)dZsj,8
which realizes a coupled Hawkes–Markov chain and recovers the classical multivariate Hawkes process by choosing λti=μi+j→i∑∫0t−hij(t−s)dZsj,9 (Morariu-Patrichi et al., 2017).
2. Well-posedness, non-explosion, and exact construction
For finite but heterogeneous networks, existence and uniqueness are typically established by thinning, Picard iteration, and convolution Grönwall estimates. Under Hypothesis 2.3 in the random-graph model, if G=(S,E)0 is Lipschitz, G=(S,E)1, G=(S,E)2 is continuous in G=(S,E)3, Lipschitz in G=(S,E)4 uniformly in G=(S,E)5, and bounded, and the graph weights G=(S,E)6 satisfy uniform bounds, then for each fixed G=(S,E)7 and graph realization there is a unique adapted solution G=(S,E)8 satisfying
G=(S,E)9
Uniqueness is obtained by comparing two solutions through the total-variation difference (G,μ,h)0, while existence follows from Picard iteration (Agathe-Nerine, 2021).
On a possibly infinite directed graph, Delattre–Fournier–Hoffmann assume weighted Lipschitz and integrability conditions involving constants (G,μ,h)1, (G,μ,h)2, and a locally integrable (G,μ,h)3. Their Theorem 6 yields a unique pathwise solution (G,μ,h)4 such that
Hybrid marked point processes admit a general non-explosion theory. Morariu-Patrichi and Pakkanen prove strong existence and uniqueness for product-form intensities under either a sublinearity condition indexed by a nondecreasing sequence (G,μ,h)6 with (G,μ,h)7, or a Hawkes-type domination condition
(G,μ,h)8
together with
(G,μ,h)9
The construction proceeds by thinning a Poisson random measureZti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.0 through
In variable-length memory models, bounded spiking rates supply an especially transparent non-explosion criterion. If Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.2 is nonincreasing and
then Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.4, so each coordinate has finitely many jumps on finite intervals. The same framework underlies the graphical construction and perfect simulation algorithm for the stationary process (Goncalves et al., 2022).
3. Mean-field, graphon, and fluctuation limits
A central theme is propagation of chaos: as the number of interacting components grows, finite subsets become asymptotically independent after coupling with a nonlinear limit process. In the age-dependent mean-field setting, one couples the Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.5-particle system Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.6 to i.i.d. copies Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.7 of a McKean–Vlasov limit driven by the same Poisson random measures and the same past. Under the Lipschitz condition Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.8 and square-integrability assumptions on Zti=∫0t∫0∞1{z≤λs−i}πi(ds,dz),λti=μi+j→i∑∫0t−hij(t−s)dZsj.9 and Zd0, Theorem 4.1 gives
Zd1
The limit intensity is deterministic and continuous, and the law of the age process solves the Pakdaman–Perthame–Salort age-structured PDE
Zd2
with
Zd3
This provides a rigorous micro–macro link between interacting Hawkes particles and an age-PDE description (Chevallier, 2015).
For random spatial graphs, the macroscopic limit is encoded by the nonlinear convolution equation
Zd4
where Zd5 is the limit graphon and Zd6 is the limiting spatial distribution. A quenched coupling uses the same Poisson random measures to build both the finite system and an inhomogeneous Poisson comparison process Zd7 with intensity Zd8. Under graph-convergence in cut norm and moment bounds on Zd9, Theorem 3.5 yields
x1,…,xN∈I⊂Rd0
while a stronger operator-norm hypothesis gives uniform convergence in x1,…,xN∈I⊂Rd1. The empirical measure
x1,…,xN∈I⊂Rd2
also converges in bounded-Lipschitz distance to the law of a Poisson process with intensity x1,…,xN∈I⊂Rd3 under x1,…,xN∈I⊂Rd4 (Agathe-Nerine, 2021).
Second-order asymptotics are now well developed in several regimes. For mean-field interacting age-dependent Hawkes processes, the fluctuation field
x1,…,xN∈I⊂Rd5
converges to a Gaussian limit characterized by a linear stochastic system driven by Gaussian noise rather than Poisson noise. The proof combines Poisson thinning coupling, a Hilbert-space approach with weighted Sobolev spaces, and Rebolledo’s Martingale CLT (Chevallier, 2016).
A distinct limit appears in the diffusive x1,…,xN∈I⊂Rd6-regime. Erny, Löcherbach and Loukianova consider a fully symmetric system in which each spike delivers a random kick of size x1,…,xN∈I⊂Rd7 to a common membrane potential. The extended generator converges to that of the diffusion
x1,…,xN∈I⊂Rd8
so the common intensity converges in distribution in Skorohod space to a CIR-type diffusion. For any fixed x1,…,xN∈I⊂Rd9, the point processes ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),0 converge to conditionally independent counting processes with hazard ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),1; the authors describe this as conditional propagation of chaos (Erny et al., 2019).
4. Spatial structure, long-time asymptotics, and stability regimes
Long-time behavior depends sharply on the interaction spectrum. In the linear random-graphon model,
If ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),5, then there is a unique bounded continuous limit ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),6 solving
and ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),8 for each ξij(N)∼Bernoulli(WN(xi,xj)),Aij(N):=κi(N)ξij(N),9. The limit admits the Neumann-series expansion
If λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).1 and λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).2, then λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).3, recovering the mean-field result; any nonuniform indegree λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).4 imprints spatial variation in the long-time firing rate. By contrast, if λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).5 and λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).6 satisfies a mild irreducibility/primitivity condition, then λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).7 exponentially fast, with growth rate λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).8 determined by λi(N)(t)=f(u0(t,xi)+N1j=1∑NAij(N)∫0t−h(t−s)dZj(N)(s)).9. Spatial inhomogeneity thus enters through the spectrum and eigenfunctions of f0 (Agathe-Nerine, 2021).
For random spatial graphs with exponential memory
f1
the synaptic current
f2
obeys a finite-dimensional Markovian dynamics. If f3 is the spectral radius of the operator
f4
and f5, then the deterministic neural-field ODE has a unique stationary solution f6 and the finite system remains close to it over polynomial times. More precisely, for every sufficiently small f7 there exist constants f8 and a burn-in time f9 such that, with probability tending to λti=μi+j→i∑∫0t−hij(t−s)dZsj,00 as λti=μi+j→i∑∫0t−hij(t−s)dZsj,01,
λti=μi+j→i∑∫0t−hij(t−s)dZsj,02
The proof balances exponential contraction of the linearized semigroup against concentration inequalities for Bernoulli edges and martingale bounds for the Poisson noise (Agathe-Nerine, 2022).
On the circle, translation symmetry produces a qualitatively different large-time picture. For neurons at equally spaced points on λti=μi+j→i∑∫0t−hij(t−s)dZsj,03, cosine interaction, exponential synaptic memory, and sigmoid rate
λti=μi+j→i∑∫0t−hij(t−s)dZsj,04
the neural-field limit admits a one-parameter manifold
λti=μi+j→i∑∫0t−hij(t−s)dZsj,05
of stationary solutions. The finite-λti=μi+j→i∑∫0t−hij(t−s)dZsj,06 synaptic voltage enters an λti=μi+j→i∑∫0t−hij(t−s)dZsj,07-tube around λti=μi+j→i∑∫0t−hij(t−s)dZsj,08 by time λti=μi+j→i∑∫0t−hij(t−s)dZsj,09 and stays there up to arbitrarily large polynomial times λti=μi+j→i∑∫0t−hij(t−s)dZsj,10. On the slower timescale λti=μi+j→i∑∫0t−hij(t−s)dZsj,11, the phase λti=μi+j→i∑∫0t−hij(t−s)dZsj,12 converges in law to Brownian motion on the circle with diffusion coefficient
λti=μi+j→i∑∫0t−hij(t−s)dZsj,13
This yields a rigorous phase-diffusion description of wandering bumps (Agathe-Nerine, 2023).
Power-law spatial interactions lead to a different asymptotic regime. In the long-range model on λti=μi+j→i∑∫0t−hij(t−s)dZsj,14,
λti=μi+j→i∑∫0t−hij(t−s)dZsj,15
the subcritical condition λti=μi+j→i∑∫0t−hij(t−s)dZsj,16 yields
λti=μi+j→i∑∫0t−hij(t−s)dZsj,17
If λti=μi+j→i∑∫0t−hij(t−s)dZsj,18, there is a unique λti=μi+j→i∑∫0t−hij(t−s)dZsj,19 such that λti=μi+j→i∑∫0t−hij(t−s)dZsj,20, and
λti=μi+j→i∑∫0t−hij(t−s)dZsj,21
The same paper states a heuristic dichotomy for fluctuations based on the tail exponent λti=μi+j→i∑∫0t−hij(t−s)dZsj,22: for λti=μi+j→i∑∫0t−hij(t−s)dZsj,23, the spatial kernel is tied to symmetric λti=μi+j→i∑∫0t−hij(t−s)dZsj,24-stable scaling rather than Gaussian scaling (Belmabrouk, 6 Mar 2026).
5. Memory structure, state dependence, and heterogeneous excitation
Interacting Hawkes processes need not depend on the entire past through fixed kernels. In the variable-length memory model, each neuron λti=μi+j→i∑∫0t−hij(t−s)dZsj,25 carries a membrane-potential process
λti=μi+j→i∑∫0t−hij(t−s)dZsj,26
so the relevant history resets at the last spike time. The spiking intensity is
λti=μi+j→i∑∫0t−hij(t−s)dZsj,27
with λti=μi+j→i∑∫0t−hij(t−s)dZsj,28 nonincreasing and bounded between λti=μi+j→i∑∫0t−hij(t−s)dZsj,29 and λti=μi+j→i∑∫0t−hij(t−s)dZsj,30. A graphical construction splits the dominating Poisson measure into “sure” jumps and “possible” jumps, and perfect simulation is performed through the backward “clan of ancestors.” There exists a critical threshold λti=μi+j→i∑∫0t−hij(t−s)dZsj,31 such that if
λti=μi+j→i∑∫0t−hij(t−s)dZsj,32
then the clan dies out almost surely in finite time, uniformly over λti=μi+j→i∑∫0t−hij(t−s)dZsj,33, yielding a unique stationary and ergodic Hawkes process with variable-length memory (Goncalves et al., 2022).
Age dependence and state dependence furnish two distinct mechanisms for memory modulation. In age-dependent Hawkes models, the elapsed time since the last spike enters the intensity map directly and leads, in the mean-field limit, to a nonlinear age-PDE of von Foerster–McKendrick type (Chevallier, 2015). In hybrid marked point processes, by contrast, the marks carry the post-jump state, and the state feeds back into both the event rate and the transition mechanism. Morariu-Patrichi and Pakkanen emphasize feedback loops and regime-switching as characteristic phenomena of this framework, and recover a pure Markov jump chain by setting λti=μi+j→i∑∫0t−hij(t−s)dZsj,34 while retaining state-dependent jump probabilities (Morariu-Patrichi et al., 2017).
Two further extensions modify how one event influences later ones. In the two-population model with multiplicative inhibition, the excitatory intensity is
λti=μi+j→i∑∫0t−hij(t−s)dZsj,35
for the inhibitory population. In the fully coupled case with λti=μi+j→i∑∫0t−hij(t−s)dZsj,36, Theorem 3.1 shows that population λti=μi+j→i∑∫0t−hij(t−s)dZsj,37 is never supercritical; if λti=μi+j→i∑∫0t−hij(t−s)dZsj,38, the long-time behavior is governed by the self-map λti=μi+j→i∑∫0t−hij(t−s)dZsj,39, and failure of λti=μi+j→i∑∫0t−hij(t−s)dZsj,40 to reduce to a singleton is associated numerically with persistent oscillations (Duval et al., 2021).
The Ancestor Hawkes process of Ross and Deutsch introduces latent labels λti=μi+j→i∑∫0t−hij(t−s)dZsj,41 that distinguish immigrant events from triggered events. Its intensity in dimension λti=μi+j→i∑∫0t−hij(t−s)dZsj,42 is
λti=μi+j→i∑∫0t−hij(t−s)dZsj,43
so first-generation and later-generation events can have different excitation matrices. In a standard Hawkes process one would set λti=μi+j→i∑∫0t−hij(t−s)dZsj,44; the ancestor formulation separates the two mechanisms. The stability condition is λti=μi+j→i∑∫0t−hij(t−s)dZsj,45, and the group-chat application shows that immigrant-message influence λti=μi+j→i∑∫0t−hij(t−s)dZsj,46 is systematically larger than triggered-message influence λti=μi+j→i∑∫0t−hij(t−s)dZsj,47, whereas a standard Hawkes fit “blurs” these mechanisms (Ross et al., 4 May 2026).
6. Statistical methodology, approximation, and applications
Current statistical work treats interacting Hawkes processes as flexible models for high-dimensional event data rather than only as analytically tractable linear systems. One approximation route starts from a univariate marked Hawkes process and partitions the mark space into λti=μi+j→i∑∫0t−hij(t−s)dZsj,48 cells. The resulting λti=μi+j→i∑∫0t−hij(t−s)dZsj,49-variate unmarked representation has intensities
λti=μi+j→i∑∫0t−hij(t−s)dZsj,50
and the marked intensity is reconstructed by
λti=μi+j→i∑∫0t−hij(t−s)dZsj,51
Under continuity and compactness assumptions, the multivariate representation approximates the true marked intensity in λti=μi+j→i∑∫0t−hij(t−s)dZsj,52 as the partition is refined, inherits stationarity when the original process is stationary, and has identifiable conditional-intensity parameters under assumptions (A1)–(A4) (Davis et al., 2024).
For high-dimensional generalized nonlinear Hawkes processes, variational Bayes methods now supply scalable nonparametric inference. The model
λti=μi+j→i∑∫0t−hij(t−s)dZsj,53
is equipped with spike-and-slab priors on the kernels, basis expansions λti=μi+j→i∑∫0t−hij(t−s)dZsj,54, and a mean-field variational approximation. In the sigmoid case, Pólya–Gamma augmentation and a thinned Poisson process yield Gaussian variational factors with closed-form updates, and a two-step sparsity-inducing procedure thresholds the posterior means of the kernel λti=μi+j→i∑∫0t−hij(t−s)dZsj,55-norms
λti=μi+j→i∑∫0t−hij(t−s)dZsj,56
The algorithm is parallelisable and computationally efficient in high-dimensional setting, and the variational posterior concentrates in λti=μi+j→i∑∫0t−hij(t−s)dZsj,57-norm at the same rate as the full posterior under the stated prior-mass, entropy, and approximation conditions (Sulem et al., 2022).
Sparse-network estimation with covariates and common drivers is addressed by the model
λti=μi+j→i∑∫0t−hij(t−s)dZsj,58
Kreiss, Mammen and Polonik estimate λti=μi+j→i∑∫0t−hij(t−s)dZsj,59 by penalized least squares with λti=μi+j→i∑∫0t−hij(t−s)dZsj,60-penalties on the rows of λti=μi+j→i∑∫0t−hij(t−s)dZsj,61, prove first-stage consistency and a de-biased asymptotic normality result
λti=μi+j→i∑∫0t−hij(t−s)dZsj,62
and obtain per-actor convergence rates for the local parameters under compatibility conditions and sparsity assumptions (Kreiss et al., 4 Apr 2025).
A different methodological issue is incomplete observation. Bayesian inference from aggregated data treats the exact point pattern λti=μi+j→i∑∫0t−hij(t−s)dZsj,63 and latent branching structure λti=μi+j→i∑∫0t−hij(t−s)dZsj,64 as missing data, and samples from
λti=μi+j→i∑∫0t−hij(t−s)dZsj,65
subject to the observed bin counts. The identifiability results cover temporal, spatio-temporal, and mutually exciting Hawkes processes under general specifications, and the MCMC updates combine conjugate Gibbs steps for λti=μi+j→i∑∫0t−hij(t−s)dZsj,66, λti=μi+j→i∑∫0t−hij(t−s)dZsj,67, and λti=μi+j→i∑∫0t−hij(t−s)dZsj,68 with Metropolis–Hastings updates for nonconjugate parameters and latent event times and locations (Zhou et al., 2022).
Discrete-time interacting Hawkes models can also be fitted nonparametrically. Browning and collaborators model the multivariate discrete-time kernel λti=μi+j→i∑∫0t−hij(t−s)dZsj,69 as a random histogram with an unknown number of bins λti=μi+j→i∑∫0t−hij(t−s)dZsj,70, unknown knot locations, and unknown heights. Reversible-jump MCMC performs within-model knot moves and birth–death updates for λti=μi+j→i∑∫0t−hij(t−s)dZsj,71, allowing the triggering kernel to take the form of any step function rather than a fixed parametric family (Browning et al., 2022).
Taken together, these developments show that interacting Hawkes processes now encompass exact and perfect simulation, graphon and mean-field asymptotics, age- and state-structured dynamics, long-time stability and oscillation theory, and statistically identifiable high-dimensional inference under sparsity, aggregation, or nonparametric kernel uncertainty. A plausible implication is that the classical linear complete-graph model is now best viewed as one analytically convenient corner of a much broader interacting point-process theory.