Metric embedding, hyperbolic space, and social networks
From MaRDI portal
Publication:340518
DOI10.1016/j.comgeo.2016.08.003zbMath1350.05106OpenAlexW2509328490MaRDI QIDQ340518
Publication date: 14 November 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.08.003
Social networks; opinion dynamics (91D30) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Recent Results on Hyperbolicity on Unitary Operators on Graphs ⋮ Limitations on realistic hyperbolic graph drawing ⋮ Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant ⋮ On the hyperbolicity constant of circular-arc graphs ⋮ A simple approach for lower-bounding the distortion in any hyperbolic embedding ⋮ Spherical graph drawing by multi-dimensional scaling ⋮ Geometric and topological properties of the complementary prism networks ⋮ Gromov hyperbolicity in Mycielskian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Lower bounds on the distortion of embedding finite metric spaces in graphs
- Embeddings of Gromov hyperbolic spaces
- Computing the Gromov hyperbolicity of a discrete metric space
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
- Extensions of Lipschitz mappings into a Hilbert space
- Triangulation and embedding using small sets of beacons
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Plongements lipschitziens dans ${\bbfR}\sp n$
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Metric embedding, hyperbolic space, and social networks