Nearest-neighbour Markov point processes on graphs with Euclidean edges
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â'Moller 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.
|Keywords||Delaunay neighbour, Graph with Euclidean edges, Linear network, Markov point process, Nearest-neighbour interaction, Renewal process|
|Journal||Advances in Applied Probability|
van Lieshout, M.N.M. (2018). Nearest-neighbour Markov point processes on graphs with Euclidean edges. Advances in Applied Probability, 50(4), 1275–1293. doi:10.1017/apr.2018.60