Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations

DOI10.1080/00949655.2012.749877zbMATH Open1453.60016OpenAlexW2090087933MaRDI QIDQ5220002FDOQ5220002

Christian Hirsch, Volker Schmidt, Catherine Gloaguen, David Werner Neuhäuser

Publication date: 9 March 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2012.749877

zbMATH Keywords

stochastic geometryPalm measureCox processstationary iterated tessellationdirect simulation algorithmPDTratio limitsshortest-path length

Mathematics Subject Classification ID

Computational methods for problems pertaining to probability theory (60-08) Geometric probability and stochastic geometry (60D05)

Cites Work

• Statistical Analysis and Modelling of Spatial Point Patterns
• Theory of Random Sets
• Stochastic and Integral Geometry
• Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
• Handbook of Monte Carlo Methods
• Title not available (Why is that?)
• On the distribution of typical shortest-path lengths in connected random geometric graphs
• Densities of Shortest Path Lengths in Spatial Stochastic Networks
• Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
• Some distributional results for Poisson-Voronoi tessellations
• Simulation of typical Cox-Voronoi cells with a special regard to implementation tests

Cited In (3)

• Exponential moments for planar tessellations
• Distributional properties of the typical cell of stationary iterated tessellations
• Continuum percolation for Cox point processes

This page was built for publication: Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220002)