Degree correlations in scale-free random graph models

DOI10.1017/jpr.2019.45zbMath1421.05082arXiv1709.01085OpenAlexW2978062231MaRDI QIDQ5235048

Clara Stegehuis

Publication date: 7 October 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphdegree correlations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (4)

Asymptotics for cliques in scale-free random graphs ⋮ Optimal subgraph structures in scale-free configuration models ⋮ Counting cliques and cycles in scale-free inhomogeneous random graphs ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability criteria and localization of the matrix spectrum in terms of trace functions
• On the largest component of a hyperbolic model of complex networks
• Continuum limit of critical inhomogeneous random graphs
• On the two-body permutation-parity combinatorial transformation
• Generating simple random graphs with prescribed degree distribution
• Universality for the distance in finite variance random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Optimal subgraph structures in scale-free configuration models
• Universality for first passage percolation on sparse random graphs
• The probability of connectivity in a hyperbolic model of complex networks
• Random Graphs and Complex Networks
• Mixed Degree-Degree Correlations in Directed Social Networks
• Clustering and the Hyperbolic Geometry of Complex Networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• A simple solution to the k‐core problem
• Upper Bounds for Number of Removed Edges in the Erased Configuration Model
• Limit theorems for assortativity and clustering in null models for scale-free networks
• Sampling Geometric Inhomogeneous Random Graphs in Linear Time
• Distances in random graphs with finite variance degrees
• The average distances in random graphs with given expected degrees

This page was built for publication: Degree correlations in scale-free random graph models