Scale-free network clustering in hyperbolic and other random graphs
From MaRDI portal
Publication:5055677
DOI10.1088/1751-8121/ab2269OpenAlexW3100616040WikidataQ127866920 ScholiaQ127866920MaRDI QIDQ5055677
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
Publication date: 9 December 2022
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03002
Related Items (4)
Not all interventions are equal for the height of the second peak ⋮ Scaling of the clustering function in spatial inhomogeneous random graphs ⋮ Clustering in a hyperbolic model of complex networks ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient
Cites Work
- Unnamed Item
- Unnamed Item
- Assortativity and clustering of sparse random intersection graphs
- On the largest component of a hyperbolic model of complex networks
- Generating simple random graphs with prescribed degree distribution
- Diameters in preferential attachment models
- On percolation in random graphs with given vertex degrees
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Triadic closure in configuration models with unbounded degree fluctuations
- Popularity based random graph models leading to a scale-free degree sequence
- Degree and clustering coefficient in sparse random intersection graphs
- Spatial preferential attachment networks: power laws and clustering coefficients
- Distances in random graphs with finite mean and infinite variance degrees
- Random Graphs and Complex Networks
- Typical Distances in Ultrasmall Random Networks
- A Spatial Web Graph Model with Local Influence Regions
- Emergence of Scaling in Random Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- On Random Intersection Graphs: The Subgraph Problem
- Community structure in social and biological networks
- On the Diameter of Hyperbolic Random Graphs
- The average distances in random graphs with given expected degrees
This page was built for publication: Scale-free network clustering in hyperbolic and other random graphs