On a geometrization of the Chung-Lu model for complex networks
From MaRDI portal
Recommendations
- Typical distances in a geometric model for complex networks
- On the largest component of a hyperbolic model of complex networks
- Clustering in a hyperbolic model of complex networks
- Clustering and the hyperbolic geometry of complex networks
- Law of large numbers for the largest component in a hyperbolic model of complex networks
Cited in
(17)- Geometric inhomogeneous random graphs
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- The contact process on random hyperbolic graphs: metastability and critical exponents
- Limit theory for isolated and extreme points in hyperbolic random geometric graphs
- Clustering in a hyperbolic model of complex networks
- New preconditioners applied to linear programming and the compressive sensing problems
- The probability of connectivity in a hyperbolic model of complex networks
- Typical distances in a geometric model for complex networks
- Sub-tree counts on hyperbolic random geometric graphs
- A generalised model for asymptotically-scale-free geographical networks
- On the second largest component of random hyperbolic graphs
- Non-hyperbolicity of random graphs with given expected degrees
- Clustering and the hyperbolic geometry of complex networks
- The modularity of random graphs on the hyperbolic plane
- Average distance in a general class of scale-free networks
- Hamilton cycles and perfect matchings in the KPKVB model
- Cliques in hyperbolic random graphs
This page was built for publication: On a geometrization of the Chung-Lu model for complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689362)
