Descending chains, the lilypond model, and mutual-nearest-neighbour matching
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
|Collections||ANU Research Publications|
|Source:||Advances in Applied Probability|
|01_Daley_Descending_chains,_the_2005.pdf||2.27 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.