We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Department of Mathematical Sciences

Seminar Archives

On this page you can find information about seminars in this and previous academic years, where available on the database.

Statistics Seminars: Fractal and aggregate tessellations

Presented by Sergei Zuyev,

12 October 2001 00:00 in CM221

"Voronoi tessellation is one of the simplest model for many systems employing subdivisions of space. Quite often, however, more realistic modelling calls for more complex tessellations that could take into consideration the observed irregularity of cells.Let T_0, T_1,... be a sequence of tessellations which cells are associated with nuclei. For each T_0-cell C(x) with nucleus x the aggregate cell C_0^1(x) of level 1 is the union of those cells of T_1 which nuclei lie in C(x). The second level aggregate cell C_0^2(x) is the union of those T_2-cells which nuclei lie in C_0^1(x), etc. Such aggregate tessellations appear naturally, for instance, in modelling of hierarchical telecommunications networks, where the the cells C_0^n represent the service zones of switches (n+1)-levels above in the hierarchical chain. Even if all T_i are Voronoi tessellations, the aggregate tessellations' cells may be empty, they are not, in general, convex nor connected nor contain their nuclei. We present results for aggregate tessellations that are based on stationary random tessellations, mainly Poisson-Voronoi ones. We find expressions for a typical aggregate cell's coverage probability, give bounds on variation of its boundary and study conditions assuring existence of the limit fractal tessellation as n grows to infinity. The talk will (hopefully) be assisted by a computer program PVAT downloadable from the author's web-page, enabling construction and visualisation of aggregate tessellations."

"Department of Statistics and Modelling Science, University of Strathclyde"

Contact for more information