Hostname: page-component-7b7567c8c-2rsb6 Total loading time: 0 Render date: 2026-11-12T19:08:46.631Z Has data issue: false hasContentIssue false

Nearest-neighbour Markov point processes on graphs with Euclidean edges

Published online by Cambridge University Press:  29 November 2018

M. N. M. van Lieshout*
Affiliation:
CWI and University of Twente
*
* Postal address: CWI, PO Box 94079, NL-1090 GB Amsterdam, The Netherlands. Email address: marie-colette.van.lieshout@cwi.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We define nearest-neighbour point processes on graphs with Euclidean edges and linear networks. They can be seen as analogues of renewal processes on the real line. We show that the Delaunay neighbourhood relation on a tree satisfies the Baddeley‒Møller consistency conditions and provide a characterisation of Markov functions with respect to this relation. We show that a modified relation defined in terms of the local geometry of the graph satisfies the consistency conditions for all graphs with Euclidean edges that do not contain triangles.

Information

Type
Original Article
Copyright
Copyright © Applied Probability Trust 2018