Jump to ContentJump to Main Navigation
Lectures on Complex Networks$
Users without a subscription are not able to see the full content.

Sergey Dorogovtsev

Print publication date: 2010

Print ISBN-13: 9780199548927

Published to Oxford Scholarship Online: May 2010

DOI: 10.1093/acprof:oso/9780199548927.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 19 July 2019

Self-organization of networks

Self-organization of networks

Chapter:
(p.51) 7 Self-organization of networks
Source:
Lectures on Complex Networks
Author(s):

Sergey N. Dorogovtsev

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199548927.003.0007

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

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .