Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 3 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Traffic Flow in a Hyperbolic Network: Definition and Properties of the Core will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-181621

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.