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: 16 July 2020

Percolation and epidemics

Percolation and epidemics

(p.41) 6 Percolation and epidemics
Lectures on Complex Networks

Sergey N. Dorogovtsev

Oxford University Press

This chapter considers the organization of connected components in uncorrelated networks, in particular, the structure and size of a giant connected component. These properties are closely related to the percolation properties of these networks. The value of the percolation threshold for various degree distributions is estimated, and the resilience of scale-free networks against random failures is described. The hierarchical organization of k-cores in these networks is discussed. A few basic epidemic models on complex networks are introduced, and the evolution of diseases in networks is described.

Keywords:   connected components, percolation, percolation threshold, ultra-resilience phenomenon, k-cores, epidemic threshold

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 .