Connectivity threshold and recovery time in rank-based models for complex networks

DOI10.1016/J.DISC.2011.02.031zbMath1223.05281OpenAlexW1980645473MaRDI QIDQ536217

Paweł Prałat

Publication date: 16 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.031

zbMATH Keywords

random graphsscale-free networkspower law graphsprotean graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10)

Related Items (1)

Protean graphs with a variety of ranking schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The diameter of protean graphs
• Protean graphs with a variety of ranking schemes
• NIST digital library of mathematical functions
• Sudden emergence of a giant \(k\)-core in a random graph
• Protean Graphs
• Growing Protean Graphs
• Rank-Based Attachment Leads to Power Law Graphs
• Protean Graphs with a Variety of Ranking Schemes

This page was built for publication: Connectivity threshold and recovery time in rank-based models for complex networks