Euclidean versus hyperbolic congestion in idealized versus experimental networks

DOI10.1080/15427951.2010.554320zbMATH Open1245.68033OpenAlexW2009182597MaRDI QIDQ2909112FDOQ2909112

Authors Jonckheere Edmond, Mingji Lou, Francis Bonahon, Yuliy Baryshnikov

Publication date 29 August 2012

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1318514562

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Core congestion is inherent in hyperbolic networks
• Traffic congestion in expanders and \((p,\delta )\)-hyperbolic spaces
• Non-hyperbolicity in random regular graphs and their traffic characteristics
• Navigation in networks by the Bolyai-Lobachevsky hyperbolic geometry
• scientific article; zbMATH DE number 2079723

Cited in

(15)

• Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
• Obstructions to a small hyperbolicity in Helly graphs
• Fellow travelers phenomenon present in real-world networks
• Navigating the negative curvature of Google Maps
• Core congestion is inherent in hyperbolic networks
• A review of two network curvature measures
• Quantum networks: anti-core of spin chains
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
• Data center interconnection networks are not hyperbolic
• Traffic congestion in expanders and \((p,\delta )\)-hyperbolic spaces
• Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
• On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions
• Differential geometric treewidth estimation in adiabatic quantum computation
• Information transfer fidelity in spin networks and ring-based quantum routers
• Generalized chordality, vertex separators and hyperbolicity on graphs

This page was built for publication: Euclidean versus hyperbolic congestion in idealized versus experimental networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909112)