Jump to ContentJump to Main Navigation
The Structure of Complex NetworksTheory and Applications$
Users without a subscription are not able to see the full content.

Ernesto Estrada

Print publication date: 2011

Print ISBN-13: 9780199591756

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199591756.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: 20 July 2019

Random models of networks

Random models of networks

Chapter:
(p.232) (p.233) 12 Random models of networks
Source:
The Structure of Complex Networks
Author(s):

Ernesto Estrada

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

This chapter describes random models frequently used for studying complex networks. These include the Erdös-Rényi, Barabási-Albert and its variations, small-world models of Watts-Strogatz and Kleinberg, and random geometric, range-dependent, lock-and-key, and stickiness models. It also discusses the topological properties of the networks generated with these modes, including clustering, metric, and spectral properties.

Keywords:   Erdös-Rényi model, Barabási-Albert model, random graphs, Watts-Strogatz model, Kleinberg model, random geometric networks, range-dependent model, stickiness model

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 .