Log-Gaussian Cox process on general metric graphs

Summary The modelling of spatial point processes has advanced considerably, yet extending these models to non-Euclidean domains, such as road networks, remains a challenging problem. We propose a novel framework for log-Gaussian Cox processes on general compact metric graphs by leveraging the Gaussian Whittle–Matérn fields, which are solutions to fractional-order stochastic differential equations on metric graphs. To achieve computationally efficient likelihood-based inference, we introduce a numerical approximation of the likelihood that eliminates the need to approximate the Gaussian process. This method, coupled with the exact evaluation of finite-dimensional distributions for Whittle–Matérn fields with integer smoothness, ensures scalability and theoretical rigour, with derived convergence rates for posterior distributions. The framework is implemented in the open-source MetricGraph R package, which integrates seamlessly with R-INLA to support fully Bayesian inference. We demonstrate the applicability and scalability of this approach through an analysis of road accident data from Al-Ahsa, Saudi Arabia, consisting of over 160,000 road segments. By identifying high-risk road segments using exceedance probabilities and excursion sets, our framework provides localized insights into accident hotspots and offers a powerful tool for modelling spatial point processes directly on complex networks.

Authors

Institutions

Publication Details

Journal
Biometrika
Published
2026-06-29
DOI
https://doi.org/10.1093/biomet/asag043
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Log-Gaussian Cox process on general metric graphs

Alexandre B. Simas, Damilya Saduakhas, David Bolin
Biometrika
Point processes and geometric inequalities
article

Log-Gaussian Cox process on general metric graphs

Alexandre B. Simas, Damilya Saduakhas, David Bolin
article en

Abstract

Summary The modelling of spatial point processes has advanced considerably, yet extending these models to non-Euclidean domains, such as road networks, remains a challenging problem. We propose a novel framework for log-Gaussian Cox processes on general compact metric graphs by leveraging the Gaussian Whittle–Matérn fields, which are solutions to fractional-order stochastic differential equations on metric graphs. To achieve computationally efficient likelihood-based inference, we introduce a numerical approximation of the likelihood that eliminates the need to approximate the Gaussian process. This method, coupled with the exact evaluation of finite-dimensional distributions for Whittle–Matérn fields with integer smoothness, ensures scalability and theoretical rigour, with derived convergence rates for posterior distributions. The framework is implemented in the open-source MetricGraph R package, which integrates seamlessly with R-INLA to support fully Bayesian inference. We demonstrate the applicability and scalability of this approach through an analysis of road accident data from Al-Ahsa, Saudi Arabia, consisting of over 160,000 road segments. By identifying high-risk road segments using exceedance probabilities and excursion sets, our framework provides localized insights into accident hotspots and offers a powerful tool for modelling spatial point processes directly on complex networks.

Biometrika
King Abdullah University of Science and Technology (SA)
Openalex Percentile: Top 6%
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.