Metric embedding, hyperbolic space, and social networks

DOI10.1145/2582112.2582139zbMATH Open1395.05048OpenAlexW2042662336MaRDI QIDQ4635576FDOQ4635576

Authors Kevin Verbeek, Subhash Suri

Publication date 23 April 2018

Published in Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2582112.2582139

Mathematics Subject Classification ID

Randomized algorithms (68W20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Metric embedding, hyperbolic space, and social networks
• A simple approach for lower-bounding the distortion in any hyperbolic embedding
• Efficient embedding of scale-free graphs in the hyperbolic plane
• Low distortion Delaunay embedding of trees in hyperbolic plane
• An improved hyperbolic embedding algorithm

Cited in

(20)

• Obstructions to a small hyperbolicity in Helly graphs
• Tree decompositions and social graphs
• Hydra: a method for strain-minimizing hyperbolic embedding of network- and distance-based data
• Fast approximation and exact computation of negative curvature parameters of graphs
• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Geometricity and embedding
• Gromov hyperbolicity in the Cartesian sum of graphs
• Hyperspherical embedding of graphs and networks in communicability spaces
• On a classical theorem on the diameter and minimum degree of a graph
• The hyperbolicity constant of infinite circulant graphs
• A simple approach for lower-bounding the distortion in any hyperbolic embedding
• Applying clique-decomposition for computing Gromov hyperbolicity
• Gromov hyperbolicity in lexicographic product graphs
• Data center interconnection networks are not hyperbolic
• Results on hyperbolicity in graphs: a survey
• On the hyperbolicity constant in graph minors
• Fast approximation and exact computation of negative curvature parameters of graphs
• Fast approximation of eccentricities and distances in hyperbolic graphs
• Metric embedding, hyperbolic space, and social networks
• Efficient embedding of scale-free graphs in the hyperbolic plane

This page was built for publication: Metric embedding, hyperbolic space, and social networks

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