# Core congestion is inherent in hyperbolic networks

@inproceedings{Chepoi2017CoreCI,
title={Core congestion is inherent in hyperbolic networks},
author={Victor Chepoi and Feodor F. Dragan and Yann Vax{\e}s},
booktitle={SODA},
year={2017}
}`
• Published in SODA 10 May 2016
• Mathematics
We investigate the impact the negative curvature has on the traffic congestion in large-scale networks. We prove that every Gromov hyperbolic network $G$ admits a core, thus answering in the positive a conjecture by Jonckheere, Lou, Bonahon, and Baryshnikov, Internet Mathematics, 7 (2011) which is based on the experimental observation by Narayan and Saniee, Physical Review E, 84 (2011) that real-world networks with small hyperbolicity have a core congestion. Namely, we prove that for every…

## Figures from this paper

Fast approximation of centrality and distances in hyperbolic graphs
• Computer Science, Mathematics
COCOA
• 2018
The performance of the algorithms for approximating centrality and distance matrix on a number of real-world networks are analyzed and it is proved that every $\delta$-hyperbolic graph G has a shortest path tree, constructible in linear time.
Applying clique-decomposition for computing Gromov hyperbolicity
• Mathematics, Computer Science
Theor. Comput. Sci.
• 2017
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
• Mathematics, Computer Science
SoCG
• 2018
This paper presents a new characterization of the hyperbolicity of graphs, via a new parameter which is called rooted insize, which has algorithmic implications in the field of large-scale network analysis and presents the first efficient algorithms for exact computation of these parameters.
Slimness of graphs
• Mathematics
Discret. Math. Theor. Comput. Sci.
• 2019
Using the layering partition technique, sharp bounds are obtained on slimness of such families of graphs as graphs with cluster-diameter $\Delta(G)$ of aLayering partition of $G$, (2) graphs with tree-length $\lambda$, (3) graphsWith tree-breadth $\rho$, (4) $k$-chordal graphs, AT-free graphs and HHD-freeGraphs.
Gromov Hyperbolicity in the Cartesian Sum of Graphs
• Mathematics
Bulletin of the Iranian Mathematical Society
• 2018
In this paper, we characterize the hyperbolic product graphs for the Cartesian sum $$G_1\oplus G_2$$G1⊕G2: $$G_1\oplus G_2$$G1⊕G2 is always hyperbolic, unless either $$G_1$$G1 or $$G_2$$G2 is the
Congestion in networks and manifolds, and fair-division problems
Several large scale networks, such as the backbone of the Internet, have been observed to behave like convex Riemannian manifolds of negative curvature. In particular, this paradigm explains the
Negatively Curved Graphs
Many applications in network science have recently been discovered for the “curvature” of a network, but there is no consensus on the definition for this term. A common approach in these applications
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
• Computer Science
ArXiv
• 2021
A new data structure is presented that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several large graphs that were far out-of-reach using previous algorithms.
The hyperbolicity constant of infinite circulant graphs
• Mathematics
• 2017
Abstract If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in

## References

SHOWING 1-10 OF 51 REFERENCES
Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
• Mathematics
Internet Math.
• 2011
A theoretical justification of the experimental exponent discrepancy observed by Narayan and Saniee between traffic loads in Gromov-hyperbolic networks from the Rocketfuel database and synthetic Euclidean lattice networks is provided.
On the Hyperbolicity of Large-Scale Networks
• Computer Science
ArXiv
• 2013
Observations indicate that -hyperbolicity is a common feature of large-scale networks, from IP-layer connectivity to citation, collaboration, co-authorship, and friendship graphs, and in conjunction with other local characteristics of networks, such as the degree distribution and clustering coecients are proposed.
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
• Wei Chen
• Mathematics, Computer Science
ISAAC
• 2012
This study provides one of the first significant analytical results on the hyperbolicity of a rich class of random graphs, which shed light on the relationship between hyperBolicity and navigability of random graph models, as well as on the sensitivity of hyperbolics {\delta} to noises in random graphs.
Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction
• Computer Science
IEEE/ACM Transactions on Networking
• 2008
It is found that if the curvature, that defines the extend of the bending, is selected in the adequate range, the accuracy of Internet distance embedding can be improved, and a new efficient centralized embedding algorithm is presented that enables the accurate embedding of short distances.
Cop and Robber Game and Hyperbolicity
• Mathematics
SIAM J. Discret. Math.
• 2014
It is proved that all cop-win graphs in the game in which the robber and the cop move at different speeds are established, which establishes a new---game-theoretical---characterization of Gromov hyperbolicity.
Packing and Covering delta -Hyperbolic Spaces by Balls
• Mathematics, Computer Science
APPROX-RANDOM
• 2007
It is shown how to construct in polynomial time a covering of S with at most Δ(S,R)balls of (slightly larger) radius R+ Δ, which is established in the general framework ofΔ-hyperbolic geodesic metric spaces and is extended to some other set families derived from balls.
Injective hulls of certain discrete metric spaces and groups
Injective metric spaces, or absolute 1-Lipschitz retracts, share a number of properties with CAT(0) spaces. In the 1960es, J. R. Isbell showed that every metric space X has an injective hull E(X).
The Average Distance in a Random Graph with Given Expected Degrees
• Mathematics, Computer Science
Internet Math.
• 2003
It is shown that for certain families of random graphs with given expected degrees, the average distance is almost surely of order log n/ logd̃ where d̃ is the weighted average of the sum of squares of the expected degrees.
Metric tree‐like structures in real‐world networks: an empirical study
• Computer Science
Networks
• 2016
This work presents strong evidence that a number of real‐world networks, taken from different domains, exhibit tree‐like structures from a metric point of view, and investigates a few graph parameters, namely, the tree‐distortion and the tree-stretch, theTree‐length and the Tree‐breadth, Gromov's hyperbolicity, the cluster‐diameter and the cluster-radius in a layering partition of a graph.
Treewidth and Hyperbolicity of the Internet
• Computer Science
2011 IEEE 10th International Symposium on Network Computing and Applications
• 2011
The tree width of the Internet appears to be quite large and being far from a tree with that respect, reflecting some high degree of connectivity, which proves the existence of a well linked core in the Internet.