메뉴 건너뛰기




Volumn 62, Issue 2, 2000, Pages 1660-1669

Largest cluster in subcritical percolation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; CORRELATION METHODS; CRYSTAL LATTICES; MONTE CARLO METHODS; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; STATISTICAL MECHANICS;

EID: 0034238726     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.62.1660     Document Type: Article
Times cited : (57)

References (46)
  • 26
    • 85036158110 scopus 로고    scopus 로고
    • URL http://xxx.lanl.gov/abs/cond-mat/9906103
    • D. B. Saakian, URL http://xxx.lanl.gov/abs/cond-mat/9906103.
    • Saakian, D.B.1
  • 30
    • 85036389735 scopus 로고    scopus 로고
    • one dimension, the largest cluster is simply the longest sequence of only “heads” in N flips of a fair coin
    • In one dimension, the largest cluster is simply the longest sequence of only “heads” in N flips of a fair coin.
  • 31
    • 85036195422 scopus 로고    scopus 로고
    • The (Formula presented) is often called the “Gumbel distribution” in honor of Gumbel’s work on applications 19, but here we acknowledge Fisher and Tippett who first discovered it 17
    • The (Formula presented) is often called the “Gumbel distribution” in honor of Gumbel’s work on applications 19, but here we acknowledge Fisher and Tippett who first discovered it 17.
  • 32
    • 85036249544 scopus 로고    scopus 로고
    • The code was originally written as a course project for Applied Physics 297r “Computational Approaches in Many-Body Physics” taught by E. Kaxiras at Harvard University in 1995
    • The code was originally written as a course project for Applied Physics 297r “Computational Approaches in Many-Body Physics” taught by E. Kaxiras at Harvard University in 1995.
  • 34
    • 85036367517 scopus 로고    scopus 로고
    • spite of its suboptimal performance near the critical point 1, the recursive burning algorithm efficiently identifies the relatively small clusters generated in subcritical simulations
    • In spite of its suboptimal performance near the critical point 1, the recursive burning algorithm efficiently identifies the relatively small clusters generated in subcritical simulations.
  • 45
    • 85036420104 scopus 로고    scopus 로고
    • Fréchet derived the same equation with (Formula presented) a year earlier 16. The year before that, Lévy published his pioneering work on stable distributions for sums of random variables 40
    • Fréchet derived the same equation with (Formula presented) a year earlier 16. The year before that, Lévy published his pioneering work on stable distributions for sums of random variables 40.
  • 46
    • 85036243400 scopus 로고    scopus 로고
    • This is technically an application of the FKG inequality 4 as explained in Ref. 43
    • This is technically an application of the FKG inequality 4 as explained in Ref. 43.


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