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

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

Cites work

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

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)