Growing Protean Graphs

DOI10.1080/15427951.2007.10129135MaRDI QIDQ3622686zbMATH OpenOpenAlexFDO

Authors Paweł Prałat, Nicholas Wormald

Publication date 28 April 2009

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2007.10129135

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Connectivity (05C40) Ordinary differential equations and systems with randomness (34F05) Network design and communication in computer systems (68M10)

Recommendations

• Protean Graphs
• Protean Graphs with a Variety of Ranking Schemes
• A general model of web graphs
• The diameter of protean graphs
• scientific article; zbMATH DE number 1990697

Cited in

(19)

• Connectivity threshold and recovery time in rank-based models for complex networks
• Evolution in web graphs
• Probabilistic Inductive Classes of Graphs
• Protean Graphs with a Variety of Ranking Schemes
• Crawling on Simple Models of Web Graphs
• The diameter of protean graphs
• Protean graphs with a variety of ranking schemes
• Randomised reproducing graphs
• Algorithms and Models for the Web-Graph
• Degree evolution in a general growing network
• The domination number of on-line social networks and random geometric graphs
• Correlated randomly growing graphs
• Random 4-regular graphs have 3-star decompositions asymptotically almost surely
• Some properties of random Apollonian networks
• Infinite Limits of Copying Models of the Web Graph
• Scale-free graphs of increasing degree
• Protean Graphs
• Activity ageing in growing networks
• On star decompositions of random regular graphs

This page was built for publication: Growing Protean Graphs

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