From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)

DOI10.4230/LIPICS.STACS.2019.5OpenAlexW2921957783MaRDI QIDQ5090451FDOQ5090451

Authors: Tobias Friedrich 

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2019.5

Recommendations

• Efficient embedding of scale-free graphs in the hyperbolic plane
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• On computing the hyperbolicity of real-world graphs
• On the diameter of hyperbolic random graphs

zbMATH Keywords

graph theoryhyperbolic geometrygraph algorithmsnetwork science

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Power-law distributions in empirical data
• Random Geometric Graphs
• Random graphs and complex networks. Volume 1
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• Connected components in random graphs with given expected degree sequences
• Random Plane Networks
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process
• The diameter of a scale-free random graph
• Social and economic networks.
• Average-Case Complexity
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A Random Graph Model for Power Law Graphs
• Metric embedding, hyperbolic space, and social networks
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• Hyperbolic graph generator
• Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
• A random graph model for massive graphs
• Average Case Complete Problems
• On the diameter of hyperbolic random graphs
• On the diameter of hyperbolic random graphs
• A Bound for the Diameter of Random Hyperbolic Graphs
• The probability of connectivity in a hyperbolic model of complex networks
• On the largest component of a hyperbolic model of complex networks
• On the average-case complexity of parameterized clique
• Exact combinatorial branch-and-bound for graph bisection
• Random hyperbolic graphs: degree sequence and clustering (extended abstract)
• Cliques in hyperbolic random graphs
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
• Tree decompositions and social graphs
• Title not available (Why is that?)
• Sampling geometric inhomogeneous random graphs in linear time
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Clustering and the hyperbolic geometry of complex networks
• Geometric inhomogeneous random graphs
• Hyperbolic random graphs: separators and treewidth
• Efficient embedding of scale-free graphs in the hyperbolic plane
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
• KADABRA is an adaptive algorithm for betweenness via random approximation
• Obtaining Optimalk-Cardinality Trees Fast
• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
• Towards a Systematic Evaluation of Generative Network Models

Cited In (1)

• Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry

This page was built for publication: From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)

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