Analysis of Point Processes on a Linear Network

The aim of this talk is to present statistical methodologies developed recently to analyse point patterns that occur on a linear network such as traffic accidents on a road networks. Applying standard statistical techniques designed to analyse point patterns in two-dimensional space, such as use of the Ripley’s K function, does not take into account the constraint that spatial points can only occur on line segments. We propose a modified version of the Ripley’s K function, which is developed as a statistic to summarize point patterns on linear networks. The techniques developed will be used to analyse the data giving locations of small spiders that nest across the gaps between bricks in a brick wall.

This is joint work with Qi Wei Ang and Adrian Baddeley