Random growth networks with exponential degree distribution

DOI10.1063/5.0022840zbMath1455.05071OpenAlexW3100106228WikidataQ103824658 ScholiaQ103824658MaRDI QIDQ5140890

Ping Wang, Xudong Luo, Renbo Zhu, Fei Ma

Publication date: 17 December 2020

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/5.0022840

zbMATH Keywords

complex networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Geometry of minimum spanning trees on scale-free networks
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Constructions of universalized Sierpiński graphs based on labeling manipulations
• A network hierarchy-based method for functional module detection in protein-protein interaction networks
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
• The number of spanning trees in Apollonian networks
• Emergence of Scaling in Random Networks
• Predicting disease-related genes by path structure and community structure in protein–protein networks
• Constructions and properties of a class of random scale-free networks
• Inhomogeneous percolation on multilayer networks
• An ensemble of random graphs with identical degree distribution
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Random growth networks with exponential degree distribution