Efficient embedding of scale-free graphs in the hyperbolic plane

DOI10.4230/LIPICS.ESA.2016.16MaRDI QIDQ4606285zbMATH OpenOpenAlexFDO

Authors Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue

Publication date 2 March 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.ESA.2016.16

zbMATH Keywords

embeddinghyperbolic planepower-law graphshyperbolic random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Elementary problems in hyperbolic and elliptic geometries (51M09)

Recommendations

• An improved hyperbolic embedding algorithm
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Geographical embedding of scale-free networks
• Metric embedding, hyperbolic space, and social networks

Cited in

(22)

• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Hyperbolic embedding model for a class of microRNA-disease networks
• The diameter of KPKVB random graphs
• The study of dynamic optimized path of complex network nodes in hyperbolic space
• Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Hyperbolic node embedding for temporal networks
• Towards a Systematic Evaluation of Generative Network Models
• An improved hyperbolic embedding algorithm
• Metric embedding, hyperbolic space, and social networks
• On the diameter of hyperbolic random graphs
• Geometric inhomogeneous random graphs
• Limitations on realistic hyperbolic graph drawing
• Geographical embedding of scale-free networks
• Metric embedding, hyperbolic space, and social networks
• Hydra: a method for strain-minimizing hyperbolic embedding of network- and distance-based data
• High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix
• Sampling geometric inhomogeneous random graphs in linear time
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
• Greedy routing and the algorithmic small-world phenomenon
• Updating dynamic random hyperbolic graphs in sublinear time
• The shortest path to network geometry. A practical guide to basic models and applications

This page was built for publication: Efficient embedding of scale-free graphs in the hyperbolic plane

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