An ensemble of random graphs with identical degree distribution

DOI10.1063/1.5105354zbMath1434.05134arXiv1904.11208OpenAlexW3104765190WikidataQ89512426 ScholiaQ89512426MaRDI QIDQ5218167

Fei Ma, Ping Wang, Xiao-Min Wang

Publication date: 28 February 2020

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

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

zbMATH Keywords

numerical simulationscomplex networks

Mathematics Subject Classification ID

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

Related Items

Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Random growth networks with exponential degree distribution ⋮ Constructions and properties of a class of random scale-free networks

Cites Work

• 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
• A network hierarchy-based method for functional module detection in protein-protein interaction networks
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• On topological properties of Sierpinski networks
• Emergence of Scaling in Random Networks
• Predicting disease-related genes by path structure and community structure in protein–protein networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Scaling laws for diffusion on (trans)fractal scale-free networks
• A critical point for random graphs with a given degree sequence
• Inhomogeneous percolation on multilayer networks
• Collective dynamics of ‘small-world’ networks