Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core
Group Theory
2012-03-09 v2 Statistical Mechanics
Networking and Internet Architecture
Metric Geometry
Abstract
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes are called the "core" of the graph. We provide a formal definition of the core in a very general context and we study the properties of this set for several graphs.
Cite
@article{arxiv.1010.3304,
title = {Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core},
author = {Yuliy Baryshnikov and Gabriel H. Tucci},
journal= {arXiv preprint arXiv:1010.3304},
year = {2012}
}
Comments
13 pages, 3 figures