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

DOI10.1016/J.DISC.2011.02.031MaRDI QIDQ536217zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1560287 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• A course on the web graph
• Growing Protean Graphs
• NIST digital library of mathematical functions
• Protean Graphs
• Protean Graphs with a Variety of Ranking Schemes
• Protean graphs with a variety of ranking schemes
• Rank-based attachment leads to power law graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• 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)