Self-organization of networks

Sergey N. Dorogovtsev

in Lectures on Complex Networks

Published in print February 2010 | ISBN: 9780199548927
Published online May 2010 | e-ISBN: 9780191720574 | DOI:

Series: Oxford Master Series in Physics

Self-organization of networks

More Like This

Show all results sharing this subject:

  • Mathematical and Statistical Physics


Show Summary Details


This chapter demonstrates how the evolution of a network shapes its complex architecture. It starts with a discussion of recursive networks, in which attachments are to nodes chosen uniformly at random, and then the preferential attachment concept is introduced. The Barabási–Albert model is discussed in detail, as well as more general models based on the preferential attachment mechanism. The emergence of scale-free complex architectures in these networks and other effects are explained. Finally, scale-free deterministic graphs are touched upon.

Keywords: preferential attachment; Barabási–Albert model; scale-free networks; accelerated growth; condensation of edges

Chapter.  5432 words.  Illustrated.

Subjects: Mathematical and Statistical Physics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.