Metric embedding, hyperbolic space, and social networks

DOI10.1145/2582112.2582139MaRDI QIDQ4635576zbMATH OpenOpenAlexFDO

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

(21)

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