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

Suman Rakshit, Tilman Davies, M. Mehdi Moradi, Greg McSwiggan, Gopalan Nair, Jorge Mateu and Adrian Baddeley

International Statistical Review, 2019, vol. 87, issue 3, 531-556

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1111/insr.12327

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:istatr:v:87:y:2019:i:3:p:531-556

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0306-7734

Access Statistics for this article

International Statistical Review is currently edited by Eugene Seneta and Kees Zeelenberg

More articles in International Statistical Review from International Statistical Institute Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().