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

© 2017 Elsevier B.V. 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. Ho...

Full description

Bibliographic Details
Main Authors: Rakshit, Suman, Nair, G., Baddeley, Adrian
Format: Journal Article
Published: 2017
Online Access:http://purl.org/au-research/grants/arc/DP130102322
http://hdl.handle.net/20.500.11937/62361
_version_ 1848760835988520960
author Rakshit, Suman
Nair, G.
Baddeley, Adrian
author_facet Rakshit, Suman
Nair, G.
Baddeley, Adrian
author_sort Rakshit, Suman
building Curtin Institutional Repository
collection Online Access
description © 2017 Elsevier B.V. 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.
first_indexed 2025-11-14T10:22:06Z
format Journal Article
id curtin-20.500.11937-62361
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T10:22:06Z
publishDate 2017
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-623612022-10-06T07:03:05Z Second-order analysis of point patterns on a network using any distance metric Rakshit, Suman Nair, G. Baddeley, Adrian © 2017 Elsevier B.V. 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. 2017 Journal Article http://hdl.handle.net/20.500.11937/62361 10.1016/j.spasta.2017.10.002 http://purl.org/au-research/grants/arc/DP130102322 restricted
spellingShingle Rakshit, Suman
Nair, G.
Baddeley, Adrian
Second-order analysis of point patterns on a network using any distance metric
title Second-order analysis of point patterns on a network using any distance metric
title_full Second-order analysis of point patterns on a network using any distance metric
title_fullStr Second-order analysis of point patterns on a network using any distance metric
title_full_unstemmed Second-order analysis of point patterns on a network using any distance metric
title_short Second-order analysis of point patterns on a network using any distance metric
title_sort second-order analysis of point patterns on a network using any distance metric
url http://purl.org/au-research/grants/arc/DP130102322
http://hdl.handle.net/20.500.11937/62361