Inferensys

Glossary

Hawkes Process

A self-exciting temporal point process where the occurrence of an event increases the probability of future events in the near term, useful for modeling bursty behavior in financial transactions or high-frequency trading.
ML engineer managing model training cluster on laptop, GPU utilization visible, technical deep learning setup.
SELF-EXCITING POINT PROCESS

What is a Hawkes Process?

A Hawkes process is a mathematical model for events that cluster in time, where each occurrence temporarily raises the probability of subsequent events.

A Hawkes process is a self-exciting temporal point process where the occurrence of an event increases the conditional intensity function, thereby elevating the probability of future events in the near term. This positive feedback loop captures bursty behavior and clustering phenomena, making it distinct from memoryless Poisson processes. The intensity at any time t is modeled as a baseline rate plus a weighted sum of the influence of all past events, where influence decays over time via a kernel function.

In financial fraud detection, Hawkes processes model the inter-arrival times of transactions to identify anomalous bursts of activity characteristic of account takeover or coordinated attacks. The self-exciting property naturally captures the rapid, repeated attempts seen in credential stuffing or high-velocity transfer schemes. By fitting a Hawkes model to normal user behavior, deviations in the branching ratio—the expected number of events triggered by a single event—serve as a robust sequence anomaly score, flagging sessions where one suspicious action cascades into many.

SELF-EXCITING DYNAMICS

Key Characteristics of Hawkes Processes

A Hawkes process is a temporal point process where each event triggers a temporary increase in the probability of subsequent events. This self-exciting property makes it uniquely suited for modeling bursty, clustered behaviors in financial transaction streams.

01

Self-Exciting Mechanism

The defining property of a Hawkes process is that the occurrence of an event elevates the conditional intensity function for a finite period afterward. In fraud detection, a rapid series of small-amount transactions (card testing) excites the model, making it anticipate further fraudulent attempts. The intensity λ(t) is modeled as:

λ(t) = μ + Σ α · g(t - tᵢ)

  • μ: Baseline intensity (normal activity rate)
  • α: Excitation strength (how much one event triggers others)
  • g(t - tᵢ): Decay kernel (how quickly the excitation fades)

This captures the intuitive reality that fraud events are rarely isolated—they cluster in time.

λ(t)
Conditional Intensity
α > 0
Excitation Parameter
02

Branching Structure Interpretation

Hawkes processes can be understood through a branching process metaphor, where each event is either an immigrant (arriving independently via the baseline rate μ) or an offspring (triggered by a prior event). This creates a causal, tree-like structure:

  • Immigrant events: Represent the background noise of normal, uncorrelated activity
  • Offspring events: Represent triggered, correlated activity—the hallmark of coordinated fraud

The branching ratio (n = ∫ g(t) dt) determines whether the process is subcritical (n < 1, dies out), critical (n = 1), or supercritical (n > 1, explodes). Most financial fraud models operate in the subcritical regime, where bursts are self-limiting.

n < 1
Subcritical Regime
μ
Immigrant Rate
03

Exponential Decay Kernel

The most common excitation kernel is the exponential decay function: g(t) = α · e^(-βt), where β controls the decay rate. This choice is computationally advantageous because it renders the intensity process Markovian—the future depends only on the current intensity, not the full history.

Key implications for transaction modeling:

  • High β: Excitation decays rapidly; only very recent events matter (e.g., velocity checks over seconds)
  • Low β: Excitation persists longer; captures slower-burn fraud patterns (e.g., credential stuffing over hours)
  • The half-life of excitation is ln(2)/β, providing an interpretable timescale for risk windows
β
Decay Rate
ln(2)/β
Excitation Half-Life
04

Multivariate Hawkes for Cross-Channel Fraud

A multivariate Hawkes process extends the framework to multiple interacting event types, where events of type j can excite events of type i through a mutually exciting matrix αᵢⱼ. This is critical for detecting cross-channel fraud:

  • A password reset (type A) may excite a beneficiary change (type B)
  • A login from a new device (type C) may excite a wire transfer (type D)
  • The excitation matrix α captures these causal dependencies between event types

This allows the model to learn that certain sequences of seemingly benign actions are precursors to fraud, even when each action individually appears normal.

αᵢⱼ
Cross-Excitation Matrix
K types
Event Dimensions
05

Parameter Estimation via Maximum Likelihood

Hawkes process parameters (μ, α, β) are typically estimated using maximum likelihood estimation (MLE). The log-likelihood for a Hawkes process over interval [0, T] with events at times t₁, t₂, ..., tₙ is:

L = Σ log λ(tᵢ) - ∫₀ᵀ λ(t) dt

  • The first term rewards high intensity at actual event times
  • The second term penalizes high intensity everywhere else (preventing trivial solutions)
  • Optimization is performed via gradient descent or expectation-maximization

For streaming fraud applications, online Bayesian updating can adapt parameters as new transactions arrive, enabling the model to track evolving fraudster behavior without full retraining.

MLE
Estimation Method
O(n²)
Naive Complexity
06

Goodness-of-Fit: Residual Analysis

Validating a fitted Hawkes process relies on the random time change theorem: if the model is correct, transforming event times by the cumulative intensity τᵢ = ∫₀ᵗⁱ λ(s) ds yields a unit-rate Poisson process. The transformed inter-arrival times should be i.i.d. Exponential(1).

Diagnostic checks include:

  • QQ-plots of transformed residuals against the exponential distribution
  • Kolmogorov-Smirnov tests for uniformity
  • Inspection of the compensator for deviations from linearity

These tests ensure the model adequately captures the temporal clustering structure and is not missing systematic patterns in the transaction stream.

τᵢ
Transformed Time
Exp(1)
Target Residual Distribution
HAWKES PROCESS EXPLAINED

Frequently Asked Questions

Clear, technical answers to the most common questions about self-exciting point processes and their application in financial fraud detection and high-frequency event modeling.

A Hawkes Process is a self-exciting temporal point process where the occurrence of an event instantaneously increases the conditional intensity—the probability of observing another event in the immediate future. Unlike a homogeneous Poisson process where events occur independently at a constant rate, the Hawkes process models events that cluster or burst together in time.

Mathematically, the conditional intensity function λ(t) is defined as:

code
λ(t) = μ + Σ α · exp(-β(t - t_i))

Where:

  • μ (mu) is the baseline intensity—the background rate of events occurring spontaneously.
  • α (alpha) is the excitation factor—the magnitude of the instantaneous jump in intensity after each event.
  • β (beta) is the decay rate—how quickly the self-exciting effect diminishes back toward baseline.
  • The summation runs over all past events t_i occurring before time t.

Each event triggers an exponentially decaying boost to the intensity, and these boosts stack additively. This creates realistic clustering behavior: a rapid succession of transactions in a short window drives the intensity higher, making further events more probable, until the excitation decays and the process returns to its baseline rate. The branching ratio n = α/β determines whether the process is subcritical (n < 1, eventually dies out) or supercritical (n > 1, explodes).

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.