Second-order analysis of point patterns on a network using any distance metric

The analysis of clustering and correlation between points on a linear network, such as traffic accident locations on a street network, depends crucially on how we measure the distance between points. Standard practice is to measure distance by the length of the shortest path. However, this may be in...

Full description

Saved in:
Bibliographic Details
Published in:Spatial statistics 2017-11, Vol.22, p.129-154
Main Authors: Rakshit, Suman, Nair, Gopalan, Baddeley, Adrian
Format: Article
Language:English
Subjects:
[formula omitted]-function
Euclidean distance
Pair correlation
Pseudostationary
Resistance distance
Shortest-path distance
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The analysis of clustering and correlation between points on a linear network, such as traffic accident locations on a street network, depends crucially on how we measure the distance between points. Standard practice is to measure distance by the length of the shortest path. However, this may be inappropriate and even fallacious in some applications. Alternative distance metrics include Euclidean, least-cost, and resistance distances. This paper develops a general framework for the second-order analysis of point patterns on a linear network, using a broad class of distance metrics on the network. We examine the model assumptions that are implicit in choosing a particular distance metric; define appropriate analogues of the K-function and pair correlation function; develop estimators of these characteristics; and study their statistical performance. The methods are tested on several datasets, including a demonstration that different conclusions can be reached using different choices of metric.
ISSN:2211-6753
2211-6753
DOI:10.1016/j.spasta.2017.10.002