메뉴 건너뛰기




Volumn 61, Issue 5, 2000, Pages 5678-5682

Epidemics and percolation in small-world networks

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL NEURAL NETWORK; EPIDEMIOLOGY; HUMAN; STATISTICAL MODEL;

EID: 0034186340     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.61.5678     Document Type: Article
Times cited : (862)

References (12)
  • 2
    • 0004081447 scopus 로고    scopus 로고
    • Princeton University Press, Princeton, NJ
    • D. J. Watts, Small Worlds (Princeton University Press, Princeton, NJ, 1999).
    • (1999) Small Worlds
    • Watts, D.J.1
  • 8
    • 85036147965 scopus 로고    scopus 로고
    • Phys. Rev. E (to be published)
    • C. Moukarzel, Phys. Rev. E (to be published).
    • Moukarzel, C.1
  • 10
    • 85036320475 scopus 로고    scopus 로고
    • Technically this point is not a percolation transition, since it is not possible to create a system-spanning (i.e., percolating) cluster on a small-world graph. To be strictly correct, we should refer to the transition as “the point at which a giant component first forms.” This is something of a mouthful, however, so we will bend the rules a little and continue to talk about “percolation” in this paper
    • Technically this point is not a percolation transition, since it is not possible to create a system-spanning (i.e., percolating) cluster on a small-world graph. To be strictly correct, we should refer to the transition as “the point at which a giant component first forms.” This is something of a mouthful, however, so we will bend the rules a little and continue to talk about “percolation” in this paper.
  • 12
    • 85036265176 scopus 로고    scopus 로고
    • We have also experimented with finite-size scaling as a method for calculating (Formula presented) Such calculations are, however, prone to inaccuracy because, as pointed out in Ref. 7, the correlation length scaling exponent (Formula presented), which governs the behavior of (Formula presented) as system size is varied, depends on the effective dimension of the graph, which itself changes with system size. Thus the exponent can at best be considered only approximately constant in a finite-size scaling calculation. Rather than introduce unknown errors into the value of (Formula presented) as a result of this approximation, we have opted in the present work to quote direct measurements of (Formula presented) on large systems as our best estimate of the percolation threshold
    • We have also experimented with finite-size scaling as a method for calculating (Formula presented) Such calculations are, however, prone to inaccuracy because, as pointed out in Ref. 7, the correlation length scaling exponent (Formula presented), which governs the behavior of (Formula presented) as system size is varied, depends on the effective dimension of the graph, which itself changes with system size. Thus the exponent can at best be considered only approximately constant in a finite-size scaling calculation. Rather than introduce unknown errors into the value of (Formula presented) as a result of this approximation, we have opted in the present work to quote direct measurements of (Formula presented) on large systems as our best estimate of the percolation threshold.


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