The degree sequences of an asymmetrical growing network

DOI10.1016/j.spl.2008.09.010zbMath1157.60007OpenAlexW2022936799MaRDI QIDQ1004254

Hui Lin Huang

Publication date: 2 March 2009

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2008.09.010

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes

Cites Work

• Unnamed Item
• Unnamed Item
• Universality for the distance in finite variance random graphs
• Connected components in random graphs with given expected degree sequences
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• Concentration of vertex degrees in a scale‐free random graph process
• Paths in graphs
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees

This page was built for publication: The degree sequences of an asymmetrical growing network