Limit theorems for assortativity and clustering in null models for scale-free networks
From MaRDI portal
Publication:5005042
DOI10.1017/apr.2020.42zbMath1469.05153arXiv1712.08097OpenAlexW3107790328MaRDI QIDQ5005042
Clara Stegehuis, Pim Van der Hoorn, Remco van der Hofstad, Nelly Litvak
Publication date: 4 August 2021
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.08097
Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)
Related Items
Optimal subgraph structures in scale-free configuration models, Degree correlations in scale-free random graph models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting triangles in power-law uniform random graphs
- Generating simple random graphs with prescribed degree distribution
- On percolation in random graphs with given vertex degrees
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Typical distances in the directed configuration model
- Triadic closure in configuration models with unbounded degree fluctuations
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Limit laws for self-loops and multiple edges in the configuration model
- Distances in random graphs with finite mean and infinite variance degrees
- Random Graphs and Complex Networks
- The Phase Transition in the Configuration Model
- Global Clustering Coefficient in Scale-Free Networks
- Upper Bounds for Number of Removed Edges in the Erased Configuration Model
- The Probability That a Random Multigraph is Simple
- Asymptotic properties of supercritical branching processes I: The Galton-Watson process
- Some problems in the enumeration of labelled graphs
- The Structure and Function of Complex Networks
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
- Degree correlations in scale-free random graph models
- The probability that a random multigraph is simple. II
- Distances in random graphs with finite variance degrees
- Collective dynamics of ‘small-world’ networks
- Critical Window for Connectivity in the Configuration Model
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks
