Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Descending chains, the lilypond model, and mutual-nearest-neighbour matching

Date

Authors

Daley, Daryl

Last, Gunter

Publisher

Applied Probability Trust

Abstract

We consider a hard-sphere model in ℝd generated by a stationary point process N and the lilypond growth protocol: at time 0, every point of N starts growing with unit speed in all directions to form a system of balls in which any particular ball ceases

Keywords

Keywords: Algorithms; Finite element method; Integral equations; Mathematical models; Poisson distribution; Probability distributions; Set theory; Descending chain; Hard-sphere model; Point process; Stationarity; Random processes Descending chain; Hard-sphere model; Lilypond model; Palm probability; Percolation; Point process; Stationarity

URI

http://hdl.handle.net/1885/85205

Collections

ANU Research Publications

Source

Advances in Applied Probability

Type

Journal article

DOI

10.1239/aap/1127483738

Restricted until

2037-12-31

Downloads

File

Description

01_Daley_Descending_chains,_the_2005.pdf (2.22 MB)