Protean graphs with a variety of ranking schemes

DOI10.1016/J.TCS.2009.05.009zbMath1192.68485OpenAlexW1500329940MaRDI QIDQ1040591

Paweł Prałat, Jeannette C. M. Janssen

Publication date: 25 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.009

zbMATH Keywords

random graphsdegree distributionscale-free networksweb graphspower law graphsprotean graphsdifferential equations method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

The Domination Number of On-line Social Networks and Random Geometric Graphs ⋮ Emergence of segregation in evolving social networks ⋮ Connectivity threshold and recovery time in rank-based models for complex networks ⋮ Scale‐free graphs of increasing degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity threshold and recovery time in rank-based models for complex networks
• The diameter of protean graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• Protean Graphs
• Growing Protean Graphs
• Handbook of Graph Theory
• Rank-Based Attachment Leads to Power Law Graphs
• Protean Graphs with a Variety of Ranking Schemes

This page was built for publication: Protean graphs with a variety of ranking schemes