From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
From MaRDI portal
Publication:5090451
DOI10.4230/LIPIcs.STACS.2019.5OpenAlexW2921957783MaRDI QIDQ5090451
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2019.5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
- On the largest component of a hyperbolic model of complex networks
- Hyperbolic graph generator
- Cliques in hyperbolic random graphs
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Geometric inhomogeneous random graphs
- Connected components in random graphs with given expected degree sequences
- The diameter of a scale-free random graph
- On the average-case complexity of parameterized clique
- A Random Graph Model for Power Law Graphs
- The probability of connectivity in a hyperbolic model of complex networks
- Random Graphs and Complex Networks
- Emergence of Scaling in Random Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- A random graph model for massive graphs
- On the Diameter of Hyperbolic Random Graphs
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Average-Case Complexity
- Power-Law Distributions in Empirical Data
- Average Case Complete Problems
- Random Plane Networks
- Random Geometric Graphs
- On the Diameter of Hyperbolic Random Graphs
- Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
- Hyperbolic Random Graphs: Separators and Treewidth
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
- Metric Embedding, Hyperbolic Space, and Social Networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- A Bound for the Diameter of Random Hyperbolic Graphs
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Obtaining Optimalk-Cardinality Trees Fast
- Exact Combinatorial Branch-and-Bound for Graph Bisection
- Collective dynamics of ‘small-world’ networks
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Clustering and the Hyperbolic Geometry of Complex Networks
- Tree decompositions and social graphs
- Towards a Systematic Evaluation of Generative Network Models
