Mark Newman
- Published in print:
- 2018
- Published Online:
- October 2018
- ISBN:
- 9780198805090
- eISBN:
- 9780191843235
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198805090.003.0015
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics
A discussion of the site percolation process on networks and its application as a model of network resilience. The chapter starts with a description of the percolation process, in which nodes are ...
More
A discussion of the site percolation process on networks and its application as a model of network resilience. The chapter starts with a description of the percolation process, in which nodes are randomly removed from a network, and of the percolation phase transition at which a giant percolating cluster forms. The properties of percolation on configuration model networks are studied, including networks with power-law degree distributions, and including both uniform and non-uniform removal of nodes. Computer algorithms for simulating percolation on real-world networks are also discussed, and numerical results are given for several example networks, including the internet and a social network.Less
A discussion of the site percolation process on networks and its application as a model of network resilience. The chapter starts with a description of the percolation process, in which nodes are randomly removed from a network, and of the percolation phase transition at which a giant percolating cluster forms. The properties of percolation on configuration model networks are studied, including networks with power-law degree distributions, and including both uniform and non-uniform removal of nodes. Computer algorithms for simulating percolation on real-world networks are also discussed, and numerical results are given for several example networks, including the internet and a social network.
J. Klafter and I.M. Sokolov
- Published in print:
- 2011
- Published Online:
- December 2013
- ISBN:
- 9780199234868
- eISBN:
- 9780191775024
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199234868.003.0010
- Subject:
- Physics, Soft Matter / Biological Physics
In this chapter another, experimentally widespread, situation is considered. The random walk takes place not on a homogeneous lattice, where each site in principle accessible to the walker, but on a ...
More
In this chapter another, experimentally widespread, situation is considered. The random walk takes place not on a homogeneous lattice, where each site in principle accessible to the walker, but on a percolation structure where some sites are not accessible. Close to the percolation threshold, when the system of accessible sites disintegrates into finite clusters, and the connected way through the whole lattice does not exist anymore, the properties of the corresponding walks are related to the fractal structure of the infinite cluster and are quite unusual. The chapter discusses some basic notions of fractal geometry, the properties of random walks on such structures and their effects on the kinetics of simple reactions in percolation systems. The case when the walker can start at an infinite as well as at a finite cluster is also considered.Less
In this chapter another, experimentally widespread, situation is considered. The random walk takes place not on a homogeneous lattice, where each site in principle accessible to the walker, but on a percolation structure where some sites are not accessible. Close to the percolation threshold, when the system of accessible sites disintegrates into finite clusters, and the connected way through the whole lattice does not exist anymore, the properties of the corresponding walks are related to the fractal structure of the infinite cluster and are quite unusual. The chapter discusses some basic notions of fractal geometry, the properties of random walks on such structures and their effects on the kinetics of simple reactions in percolation systems. The case when the walker can start at an infinite as well as at a finite cluster is also considered.
Mark Newman
- Published in print:
- 2018
- Published Online:
- October 2018
- ISBN:
- 9780198805090
- eISBN:
- 9780191843235
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198805090.003.0011
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics
An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties ...
More
An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties like the mean degree, degree distribution, and clustering coefficient. This is followed with a detailed derivation of the large-scale structural properties of random graphs, including the position of the phase transition at which a giant component appears, the size of the giant component, the average size of the small components, and the expected diameter of the network. The chapter ends with a discussion of some of the shortcomings of the random graph model.Less
An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties like the mean degree, degree distribution, and clustering coefficient. This is followed with a detailed derivation of the large-scale structural properties of random graphs, including the position of the phase transition at which a giant component appears, the size of the giant component, the average size of the small components, and the expected diameter of the network. The chapter ends with a discussion of some of the shortcomings of the random graph model.
