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: 18 July 2019

Correlations in networks

Correlations in networks

(p.61) 8 Correlations in networks
Lectures on Complex Networks

Sergey N. Dorogovtsev

Oxford University Press

This chapter discusses the simplest correlations in complex networks and explains their nature. It focuses on the correlations between the degrees of the nearest neighbours. The inevitable presence of structural correlations in non-equilibrium networks is explained by using simple examples of growing networks. The characteristics of these correlations and their kinds (assortative and disassortative) are described. Some consequences of these correlations are indicated and relations between the degree—degree correlations and clustering are discussed.

Keywords:   structural correlations, degree-degree correlations, hidden variables, assortative mixing, disassortative mixing

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 .