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, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 09 July 2020

Uncorrelated networks

Uncorrelated networks

(p.33) 5 Uncorrelated networks
Lectures on Complex Networks

Sergey N. Dorogovtsev

Oxford University Press

This chapter considers networks with an arbitrary degree distribution, in which the degrees of nodes are uncorrelated, including the degrees of the nearest-neighbour nodes. The two kinds of these networks are considered in detail. The first is the configuration model (a random graph with a given degree sequence) and the second is the static model (a random graph with a given sequence of desired degrees). The basic properties of these locally tree-like networks are discussed. The chapter also considers bipartite uncorrelated networks.

Keywords:   configuration model, static model, hidden variables, locally tree-like structure

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 .