Jump to ContentJump to Main Navigation
NetworksAn Introduction$
Users without a subscription are not able to see the full content.

Mark Newman

Print publication date: 2010

Print ISBN-13: 9780199206650

Published to Oxford Scholarship Online: September 2010

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

Percolation and network resilience

Percolation and network resilience

A discussion of one of the simplest of processes taking place on networks, percolation, and its use as a model of network resilience

Chapter:
(p.591) Chapter 16 Percolation and network resilience
Source:
Networks
Author(s):

M. E. J. Newman

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

This chapter examines one of the simplest network processes, which is percolation. This leads to an elegant theory concerning the robustness of networked systems to the failure of their components. Imagine taking a network and removing some fraction of its vertices, along with the edges connected to those vertices. This process is called percolation (or, more precisely, site percolation), and can be used as a model of a variety of real-world phenomena. The failure of routers on the Internet, for instance, can be formally represented by removing the corresponding vertices and their attached edges from a network representation of the Internet. In fact, about 3% of the routers on the Internet are non-functional for one reason or another at any one time, and it is a question of some practical interest what effect this will have on the performance of the network. The theory of percolation processes goes some way to getting the answer to this question. Exercises are provided at the end of the chapter.

Keywords:   network processes, percolation, vertices removal, computer algorithm, network systems

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 .