Bandwidth selection for kernel intensity estimators for spatial point processes

Abstract Intensity estimation through kernel smoothing is a popular non‐parametric method of describing the characteristics of an underlying spatial point process. Key to the accuracy of this estimate is the choice of bandwidth. Too large or small a bandwidth can lead to features in the intensity being lost or to the introduction of artefacts. There are many available methods of bandwidth selection for spatial point patterns, but no consensus on the best option. Popular methods and software default options lead to very different intensity estimates and contrasting conclusions about the data that can be difficult to reconcile. In response, we propose new bandwidth selectors with more stable and consistent performance. These are adapted from popular plug‐in and cross‐validation techniques developed for general multivariate density estimation. The theoretical and practical performance of these proposed methods is explored and compared with other available methods in both simulated and real‐data scenarios. We find that our proposed methods perform consistently well across a range of different intensity patterns. We end with a discussion on the implications of edge effects when applying these methods, given the constrained windows in which spatial point patterns are often observed.

Authors

Institutions

Publication Details

Journal
Scandinavian Journal of Statistics
Published
2025-03-27
DOI
https://doi.org/10.1111/sjos.12782
Citations
1
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
3.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bandwidth selection for kernel intensity estimators for spatial point processes

Martin L. Hazelton, Tilman M. Davies, Bethany J. Macdonald
1 citations
Scandinavian Journal of Statistics
Point processes and geometric inequalities
3.73
article

Bandwidth selection for kernel intensity estimators for spatial point processes

Martin L. Hazelton, Tilman M. Davies, Bethany J. Macdonald
article en
1 citations

Abstract

Abstract Intensity estimation through kernel smoothing is a popular non‐parametric method of describing the characteristics of an underlying spatial point process. Key to the accuracy of this estimate is the choice of bandwidth. Too large or small a bandwidth can lead to features in the intensity being lost or to the introduction of artefacts. There are many available methods of bandwidth selection for spatial point patterns, but no consensus on the best option. Popular methods and software default options lead to very different intensity estimates and contrasting conclusions about the data that can be difficult to reconcile. In response, we propose new bandwidth selectors with more stable and consistent performance. These are adapted from popular plug‐in and cross‐validation techniques developed for general multivariate density estimation. The theoretical and practical performance of these proposed methods is explored and compared with other available methods in both simulated and real‐data scenarios. We find that our proposed methods perform consistently well across a range of different intensity patterns. We end with a discussion on the implications of edge effects when applying these methods, given the constrained windows in which spatial point patterns are often observed.

Scandinavian Journal of StatisticsVol. 52(3)
University of Otago (NZ)
Royal Society Te Apārangi
Openalex Percentile: Top 12%
Point processes and geometric inequalities
3.73
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.