Superposition of planar voronoi tessellations
From MaRDI portal
Publication:4951467
DOI10.1080/15326340008807577zbMath0978.90013OpenAlexW2053778555MaRDI QIDQ4951467
C. Gloaguen, Sergei Zuyev, François Baccelli
Publication date: 7 May 2000
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00072977/file/RR-3692.pdf
transportationprobabilitystochasticstochastic model applicationsnetwork modelscommunicationsnetworks/graphs
Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Stochastic models in economics (91B70)
Related Items (6)
Analysis of shortest paths and subscriber line lengths in telecommunication access networks ⋮ On the distribution of typical shortest-path lengths in connected random geometric graphs ⋮ Limit theorems for stationary tessellations with random inner cell structures ⋮ 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 ⋮ Stationary iterated tessellations
This page was built for publication: Superposition of planar voronoi tessellations
