Abstract
Accurate determination of mean first-passage times (MFPTs) between any two states of a complex network still attracts considerable attention. Appropriate methods should take into account the discrepancy in MFPTs when a random walker moves first from a source to a target and then in the opposite direction. In addition, it is desirable to allow fast evaluation of mean first-passage times when transition probabilities are allowed to vary over time. For our calculations we make use of Hill’s algorithm, which enables the exact calculation of MFPTs. As we show in this work, when given a fixed distance to travel, the calculation of a particular MFPT depends on the choice of source and target points and their relative position on a lattice. We also demonstrate, when the network contains a relatively low number of cycles, that this deterministic technique provides exact results much faster in comparison to the more standard, but computationally demanding, stochastic Monte Carlo simulation method, where only approximate results can be obtained that are highly dependent on the number of walkers. Therefore, our specific implementation of Hill’s algorithm should facilitate efficient and accurate computation of MFPTs on a variety of network topologies of practical interest to the broad scientific community.
Similar content being viewed by others
References
Z. Zhang, S. Gao, Eur. Phys. J. B 80, 209 (2011)
M. Shlesinger, Nature 450, 40 (2007)
A. Einstein, Ann. Phys. 17, 549 (1905)
M. von Smoluchowski, Phys. Z. 16, 318 (1915)
M. von Smoluchowski, Phys. Z. 17, 585 (1916)
E. Schroedinger, Phys. Z. 16, 289 (1915)
M. Kurzynski, P. Chelminiak, J. Statist. Phys. 110, 137 (2003)
S. Condamin, O. Benichou, V. Tejedor, R. Voituriez, J. Klafter, Nature 450, 77 (2007)
G. Barton, Elements of Green Functions and Propagation: Potentials, Diffusion and Waves (Oxford University Press, 1989)
D. Ben-Avraham, S. Havlin, Diffusion and Reactions in Fractals and Disordered Systems (Cambridge University Press, 2000)
O. Benichou, C. Chevalier, J. Klafter, B. Meyer, R. Voituriez, Nat. Chem. 2, 472 (2010)
G. Kirchhoff, Poggendorffs Ann. Phys. Chem. 72, 495 (1847)
T.L. Hill, J. Theo. Biol. 10, 442 (1966)
T.L. Hill, Proc. Natl. Acad. Sci. USA 85, 2879 (1988)
T.L. Hill, Proc. Natl. Acad. Sci. USA 85, 3271 (1988)
T.L. Hill, Proc. Natl. Acad. Sci. USA 85, 5345 (1988)
T.L. Hill, Free Energy Transduction and Biochemical Cycle Kinetics (Springer-Verlag, 1989)
M. Torchala, Numerical simulations of the protein dynamics influence on some biomolecular electron transfer processes, Ph.D. thesis, Adam Mickiewicz University, Poznan, Poland, 2010
I. Shmulevich, E.R. Dougherty, W. Zhang, Bioinformatics 18, 1319 (2002)
S.V. Krivov, M. Karplus, Proc. Natl. Acad. Sci. USA 101, 14766 (2004)
M. Kurzynski, The Thermodynamic Machinery of Life (Springer, 2006)
E.W. Dijkstra, Numer. Math. 1, 269 (1959)
R. Sedgewick, Algorithms in C++. Graph Algorithms (Addison-Wesley, 2002)
S. Condamin, V. Tejedor, R. Voituriez, O. Benichou, J. Klafter, Proc. Natl. Acad. Sci. USA 105, 5675 (2008)
R. Wilson, Introduction to Graph Theory (Pearson Education Limited, 1996)
R. Albert, A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002)
D.P. Landau, K. Binder, A guide to Monte Carlo simulations in statistical physics (Cambridge University Press, 2000)
M. Torchala, Adv. Cheminfo. 1, 21 (2007)
M. Kurzynski, M. Torchala, P. Chelminiak (2011), e-print arXiv:physics.bio-ph/1106.4961
Author information
Authors and Affiliations
Corresponding author
Additional information
Electronic supplementary material
Figures S1-S8 are only available in electronic format at www.epj.org
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Torchala, M., Chelminiak, P. & Bates, P.A. Mean first-passage time calculations: comparison of the deterministic Hill’s algorithm with Monte Carlo simulations. Eur. Phys. J. B 85, 116 (2012). https://doi.org/10.1140/epjb/e2012-20760-8
Received:
Revised:
Published:
DOI: https://doi.org/10.1140/epjb/e2012-20760-8