z-logo
Premium
Kernel Density Estimation on a Linear Network
Author(s) -
McSwiggan Greg,
Baddeley Adrian,
Nair Gopalan
Publication year - 2017
Publication title -
scandinavian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.359
H-Index - 65
eISSN - 1467-9469
pISSN - 0303-6898
DOI - 10.1111/sjos.12255
Subject(s) - estimator , kernel density estimation , mathematics , variable kernel density estimation , kernel (algebra) , heuristic , bandwidth (computing) , mathematical optimization , gaussian , diffusion process , heat kernel , heat equation , algorithm , kernel smoother , brownian motion , kernel method , statistics , computer science , mathematical analysis , artificial intelligence , discrete mathematics , innovation diffusion , radial basis function kernel , support vector machine , computer network , physics , knowledge management , quantum mechanics
This paper develops a statistically principled approach to kernel density estimation on a network of lines, such as a road network. Existing heuristic techniques are reviewed, and their weaknesses are identified. The correct analogue of the Gaussian kernel is the ‘heat kernel’, the occupation density of Brownian motion on the network. The corresponding kernel estimator satisfies the classical time‐dependent heat equation on the network. This ‘diffusion estimator’ has good statistical properties that follow from the heat equation. It is mathematically similar to an existing heuristic technique, in that both can be expressed as sums over paths in the network. However, the diffusion estimate is an infinite sum, which cannot be evaluated using existing algorithms. Instead, the diffusion estimate can be computed rapidly by numerically solving the time‐dependent heat equation on the network. This also enables bandwidth selection using cross‐validation. The diffusion estimate with automatically selected bandwidth is demonstrated on road accident data.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here