Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.

DOI10.4230/LIPIcs.ESA.2019.21OpenAlexW2978499064MaRDI QIDQ5075758

Christopher Weyand, Manuel Penschuck, Tobias Friedrich, Maximilian Katzmann, Thomas Bläsius, Ulrich Meyer

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1905.06706

zbMATH Keywords

hyperbolic random graphsefficient network generationgeometric inhomogeneous random graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Penalising transmission to hubs in scale-free spatial random graphs

Uses Software

• Hyperbolic graph generator
• NetworKit

Cites Work

• Unnamed Item
• Hyperbolic graph generator
• Geometric inhomogeneous random graphs
• Connected components in random graphs with given expected degree sequences
• Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Sequential random sampling
• Random Plane Networks
• On the Diameter of Hyperbolic Random Graphs
• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees

This page was built for publication: Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.