Voronoi tessellations in the CRT and continuum random maps of finite excess
Given a large graph G and k agents on this graph, we consider the Voronoi tessellation induced by the graph distance. Each agent gets control of the portion of the graph that is closer to itself than to any other agent. We study the limit law of the vector Vor := (V1=n; V2=n; ...; Vk=n), whose i...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
Society for Industrial and Applied Mechanics
2018
|