Generalized percolation in random directed networks
Open Access
- 7 July 2005
- journal article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (1) , 016106
- https://doi.org/10.1103/physreve.72.016106
Abstract
We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edges--that is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Evolution and Structure of the InternetPublished by Cambridge University Press (CUP) ,2004
- Mixing patterns in networksPhysical Review E, 2003
- Evolution of NetworksPublished by Oxford University Press (OUP) ,2003
- Assortative Mixing in NetworksPhysical Review Letters, 2002
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995