Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic
Yuliy Baryshnikov, Gabriel H. Tucci

TL;DR
This paper investigates how traffic flow behaves in hyperbolic networks with exponentially decaying traffic, revealing a phase transition between localized and global traffic regimes depending on decay rate.
Contribution
It establishes the existence of a phase transition in traffic flow in hyperbolic graphs based on decay parameters, linking network geometry to congestion patterns.
Findings
Existence of a critical decay parameter $eta_c$ for phase transition.
Global traffic with a congested core occurs when $eta<eta_c$.
Traffic remains local with minimal congestion when $eta>eta_c$.
Abstract
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs when the traffic decays exponentially with the distance. We prove that under general conditions, there exists a phase transition between local and global traffic. More specifically, assume that the traffic rate between two nodes and is given by where is the distance between the nodes. Then there exists a constant that depends on the geometry of the network such that if the traffic is global and there is a small set of highly congested nodes called the core. However, if then the traffic is essentially local and the core is empty which implies very small congestion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Geometric and Algebraic Topology · Topological and Geometric Data Analysis
