메뉴 건너뛰기




Volumn 69, Issue 4, 2004, Pages 4-

Model for cascading failures in complex networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84999807972     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.69.045104     Document Type: Article
Times cited : (247)

References (33)
  • 1
    • 85036269459 scopus 로고    scopus 로고
    • S.N. Dorogovtesev and J.F.F. Mendes, Evolution of Networks (Oxford University Press, Oxford, 2003)
    • S.N. Dorogovtesev and J.F.F. Mendes, Evolution of Networks (Oxford University Press, Oxford, 2003).
  • 5
    • 85036290433 scopus 로고    scopus 로고
    • B.A. Carreras, D.E. Newman, I. Dolrou, and A.B. Poole, in Proceedings of Hawaii International Conference on System Sciences, Maui, Hawaii, 2000 (unpublished)
    • B.A. Carreras, D.E. Newman, I. Dolrou, and A.B. Poole, in Proceedings of Hawaii International Conference on System Sciences, Maui, Hawaii, 2000.
  • 7
    • 85036303412 scopus 로고    scopus 로고
    • J. Glanz and R. Perez-Pena, “90 Seconds That Left Tens of Millions of People in the Dark,” New York Times, August 26, 2003
    • J. Glanz and R. Perez-Pena, “90 Seconds That Left Tens of Millions of People in the Dark,” New York Times, August 26, 2003.
  • 19
    • 85036337471 scopus 로고    scopus 로고
    • S. Wasserman and K. Faust, Social Networks Analysis (Cambridge University Press, Cambridge, 1994)
    • S. Wasserman and K. Faust, Social Networks Analysis (Cambridge University Press, Cambridge, 1994).
  • 20
    • 85036165842 scopus 로고    scopus 로고
    • The model can be easily generalized to directed graphs
    • The model can be easily generalized to directed graphs.
  • 21
    • 85036192768 scopus 로고    scopus 로고
    • the case of an unweighted graph (Formula presented) is 1 if there is an arc joining node i to node j, and 0 otherwise
    • In the case of an unweighted graph (Formula presented) is 1 if there is an arc joining node i to node j, and 0 otherwise.
  • 23
    • 85036245974 scopus 로고    scopus 로고
    • R. Jain, The Art of Computer Systems Performance Analysis (Wiley, New York, 1991)
    • R. Jain, The Art of Computer Systems Performance Analysis (Wiley, New York, 1991).
  • 24
    • 85036362875 scopus 로고    scopus 로고
    • The harmonic composition of N numbers (Formula presented) is defined as (Formula presented)
    • The harmonic composition of N numbers (Formula presented) is defined as (Formula presented)
  • 26
    • 85036411569 scopus 로고    scopus 로고
    • Another possibility which gives the same results is to set (Formula presented)
    • Another possibility which gives the same results is to set (Formula presented)
  • 27
    • 85036368284 scopus 로고    scopus 로고
    • As an initial damage to the network here we consider the removal of a node, although the dynamics of the model can be started by the removal of one arc if one wants to simulate, for instance, the breakdown of a line in an electrical power grid
    • As an initial damage to the network here we consider the removal of a node, although the dynamics of the model can be started by the removal of one arc if one wants to simulate, for instance, the breakdown of a line in an electrical power grid.
  • 30
    • 85036369087 scopus 로고    scopus 로고
    • For load-based removals in BA scale-free graphs we have found that (Formula presented) is independent of the size of the system. In fact, we have obtained (Formula presented) 1.3±0.05, 1.28±0.05, respectively, for (Formula presented) 2000, 2500. Such a result is similar to that which is obtained in a simpler model, the fiber-bundle model, studied in Ref. 16
    • For load-based removals in BA scale-free graphs we have found that (Formula presented) is independent of the size of the system. In fact, we have obtained (Formula presented) 1.3±0.05, 1.28±0.05, respectively, for (Formula presented) 2000, 2500. Such a result is similar to that which is obtained in a simpler model, the fiber-bundle model, studied in Ref. 16.
  • 32
    • 85036136853 scopus 로고    scopus 로고
    • http://moat.nlanr.net/AS/Data/ASconnlist.20000102.946809601
    • http://moat.nlanr.net/AS/Data/ASconnlist.20000102.946809601.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.