Simulation of typical Cox-Voronoi cells with a special regard to implementation tests

DOI10.1007/s00186-005-0036-2zbMath1081.60007OpenAlexW2041281626MaRDI QIDQ811978

C. Gloaguen, Hendrik Schmidt, Frank Fleischer, Volker Schmidt

Publication date: 23 January 2006

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-005-0036-2

zbMATH Keywords

Random tessellationRandom software testingNetworkShape analysisStochastic geometryTypical cell

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Stochastic network models in operations research (90B15)

Related Items

Analysis of shortest paths and subscriber line lengths in telecommunication access networks, Shortest path distance in Manhattan Poisson line Cox process, A stochastic model for multi-hierarchical networks, Densities of Shortest Path Lengths in Spatial Stochastic Networks, Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling, Scaling limits for shortest path lengths along the edges of stationary tessellations, Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations, Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell, Empirical (Typical) Cells of the Poisson Medial Tessellation

Cites Work

• Distributional properties of the typical cell of stationary iterated tessellations
• Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
• Random tessellations in ℝ^d
• Unnamed Item
• Unnamed Item