Universal properties of growing networks

✍ Scribed by P.L Krapivsky; B Derrida

• Publisher: Elsevier Science
• Year: 2004
• Tongue: English
• Weight: 250 KB
• Volume: 340
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2004.05.020

✦ Synopsis

Networks growing according to the rule that every new node has a probability p k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power-law decays of the distribution of cluster sizes in the non-percolating phase. The percolation transition is continuous but of inÿnite order and the size of the giant component is inÿnitely di erentiable at the transition (though of course non-analytic). At the transition the average cluster size (of the ÿnite components) is discontinuous.