International Statistical Review

Fast Kernel Smoothing of Point Patterns on a Large Network using Two‐dimensional Convolution

Early View

  • Author(s): Suman Rakshit, Tilman Davies, M. Mehdi Moradi, Greg McSwiggan, Gopalan Nair, Jorge Mateu, Adrian Baddeley
  • Article first published online: 06 Jun 2019
  • DOI: 10.1111/insr.12327
  • Read on Online Library
  • Subscribe to Journal

Summary We propose a computationally efficient and statistically principled method for kernel smoothing of point pattern data on a linear network. The point locations, and the network itself, are convolved with a two‐dimensional kernel and then combined into an intensity function on the network. This can be computed rapidly using the fast Fourier transform, even on large networks and for large bandwidths, and is robust against errors in network geometry. The estimator is consistent, and its statistical efficiency is only slightly suboptimal. We discuss bias, variance, asymptotics, bandwidth selection, variance estimation, relative risk estimation and adaptive smoothing. The methods are used to analyse spatially varying frequency of traffic accidents in Western Australia and the relative risk of different types of traffic accidents in Medellín, Colombia.

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.