Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
From MaRDI portal
Recommendations
Cites work
- Collective dynamics of `small-world' networks
- Connected components in random graphs with given expected degree sequences
- Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
- 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 graph generator
- On the diameter of hyperbolic random graphs
- Querying probabilistic neighborhoods in spatial data sets efficiently
- Random Plane Networks
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- Sequential random sampling
- The average distances in random graphs with given expected degrees
Cited in
(5)- On the external validity of average-case analyses of graph algorithms
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
- On the external validity of average-case analyses of graph algorithms
- Penalising transmission to hubs in scale-free spatial random graphs
This page was built for publication: Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075758)
