arXiv · 1203.4863
Traffic Analysis in Random Delaunay Tessellations and Other Graphs
Abstract
In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random $k$-regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
John D. Hobby, Gabriel H. Tucci. 2012-03-22. Traffic Analysis in Random Delaunay Tessellations and Other Graphs. https://arxiv.org/abs/1203.4863
Cite the original work for its findings. Save a collection to share your selection of sources.