2000 character limit reached
Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core (1010.3304v2)
Published 16 Oct 2010 in math.GR, cond-mat.stat-mech, cs.NI, and math.MG
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.