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

DOI10.1016/J.DISC.2011.02.031zbMATH Open1223.05281OpenAlexW1980645473MaRDI QIDQ536217FDOQ536217

Authors: 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

Recommendations

• Protean Graphs with a Variety of Ranking Schemes
• Protean Graphs
• Protean graphs with a variety of ranking schemes
• Growing Protean Graphs
• The diameter of protean graphs

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)

Cites Work

• NIST digital library of mathematical functions
• Title not available (Why is that?)
• Sudden emergence of a giant \(k\)-core in a random graph
• Title not available (Why is that?)
• Protean graphs with a variety of ranking schemes
• Protean Graphs
• Growing Protean Graphs
• Title not available (Why is that?)
• Rank-based attachment leads to power law graphs
• A course on the web graph
• Protean Graphs with a Variety of Ranking Schemes
• The diameter of protean graphs

Cited In (2)

• Threshold-based network structural dynamics
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536217)