Popularity based random graph models leading to a scale-free degree sequence
Authors:
- Pierce G BuckleyPBPierce G Buckley
- Deryk OsthusDODeryk Osthus
- 1 May 2004
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 282 (1-3) , 53-68
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- The Diameter of a Scale-Free Random GraphCombinatorica, 2004
- A general model of web graphsRandom Structures & Algorithms, 2003
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Linearized chord diagrams and an upper bound for vassiliev invariantsJournal of Knot Theory and Its Ramifications, 2000
- Graph structure in the WebComputer Networks, 2000
- Scale-free characteristics of random networks: the topology of the world-wide webPhysica A: Statistical Mechanics and its Applications, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- Mean-field theory for scale-free random networksPhysica A: Statistical Mechanics and its Applications, 1999