메뉴 건너뛰기




Volumn 67, Issue 5 2, 2003, Pages

Transport on percolation clusters with power-law distributed bond strengths

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOND STRENGTH (CHEMICAL); CALCULATIONS; COMPUTER SIMULATION; CRITICAL CURRENT DENSITY (SUPERCONDUCTIVITY); ELECTRIC CONDUCTANCE; ELECTRIC CURRENTS; ELECTRIC RESISTANCE; NUMERICAL METHODS; PERCOLATION (SOLID STATE); STATISTICAL METHODS; SUPERCONDUCTING MATERIALS;

EID: 37649031549     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (10)

References (38)
  • 18
    • 0004021746 scopus 로고    scopus 로고
    • edited by A. Bunde and S. Havlin, 2nd ed. (Springer-Verlag, Heidelberg)
    • Fractals and Disordered Systems, edited by A. Bunde and S. Havlin, 2nd ed. (Springer-Verlag, Heidelberg, 1996).
    • (1996) Fractals and Disordered Systems
  • 28
    • 77957081350 scopus 로고    scopus 로고
    • Exact Combinatorial Algorithms: Ground States of Disordered Systems
    • edited by C. Domb and J.L. Lebowitz; (Academic Press, San Diego)
    • M. Alava, P.M. Duxbury, C. Moukarzel, and H. Rieger, in Exact Combinatorial Algorithms: Ground States of Disordered Systems, edited by C. Domb and J.L. Lebowitz, Phase Transitions and Critical Phenomena Vol. 18 (Academic Press, San Diego, 2001).
    • (2001) Phase Transitions and Critical Phenomena , vol.18
    • Alava, M.1    Duxbury, P.M.2    Moukarzel, C.3    Rieger, H.4
  • 35
    • 33645094313 scopus 로고    scopus 로고
    • note
    • Although this equivalence is strict only in the α → 1 limit, it holds with corrections for 1 > α as well.
  • 36
    • 33645094851 scopus 로고    scopus 로고
    • note
    • Similar ideas were put forward in Ref. [6], for hierarchical structures which are reducible by series and parallel transformations.
  • 37
    • 33645057098 scopus 로고    scopus 로고
    • note
    • c.
  • 38
    • 33645091536 scopus 로고    scopus 로고
    • note
    • This results from the fact that the distribution of n decays exponentially fast for large n. See Fig. 2 and Ref. [31].


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