메뉴 건너뛰기




Volumn 85, Issue 4, 2012, Pages

Mean first-passage time calculations: Comparison of the deterministic Hill's algorithm with Monte Carlo simulations

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE RESULTS; COMPLEX NETWORKS; DETERMINISTIC TECHNIQUE; EXACT CALCULATIONS; EXACT RESULTS; FIRST-PASSAGE TIME; MEAN FIRST-PASSAGE TIME; MONTE CARLO SIMULATION; MONTE CARLO SIMULATION METHODS; NETWORK TOPOLOGY; NUMBER OF CYCLES; RANDOM WALKERS; RELATIVE POSITIONS; SCIENTIFIC COMMUNITY; TARGET POINT; TRANSITION PROBABILITIES; TWO-STATE;

EID: 84862001995     PISSN: 14346028     EISSN: 14346036     Source Type: Journal    
DOI: 10.1140/epjb/e2012-20760-8     Document Type: Article
Times cited : (2)

References (29)
  • 9
    • 84862018430 scopus 로고
    • Elements of green functions and propagation: Potentials
    • (Oxford University Press
    • G. Barton, Elements of Green Functions and Propagation: Potentials, Diffusion and Waves (Oxford University Press, 1989)
    • (1989) Diffusion and Waves
    • Barton, G.1
  • 23
    • 0038108484 scopus 로고    scopus 로고
    • Algorithms in C++
    • Addison-Wesley
    • R. Sedgewick, Algorithms in C++. Graph Algorithms (Addison-Wesley, 2002)
    • (2002) Graph Algorithms
    • Sedgewick, R.1
  • 29
    • 84862018429 scopus 로고    scopus 로고
    • M. Kurzynski, M. Torchala, P. Chelminiak (2011), e-print arXiv:physics.bio-ph/1106.4961
    • M. Kurzynski, M. Torchala, P. Chelminiak (2011), e-print arXiv:physics.bio-ph/1106.4961


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