Skip to main content

Calculating MFPT for Processes Mapping into Random Walks in Inhomogeneous Networks

  • Chapter
  • First Online:
Natural Disasters, When Will They Reach Me?

Part of the book series: Springer Natural Hazards ((SPRINGERNAT))

  • 392 Accesses

Abstract

Dynamic processes leading to natural disasters often translate into random walks in state spaces which are inhomogeneous in transport characteristics. In other words, such random walks will behave differently in different parts of a network which would have different values for transport properties (\(d\!\!f\) and dw if using methods from Chap. 4). Thus, for such networks the application of \(\textit{MFPT}\) calculation methods introduced in Chap. 4 along with many other methods described in literature are not straight forward. This chapter proposes that using the novel concept of dividing the node distribution into patches/clusters known as network primitives (NPs) where all nodes within each primitive share common transport variables, and adopting a ‘hop-wise’ approach to calculate \(\textit{MFPT}\) between any source and target pair as an extension to the methods described under Chap. 4, can be a viable solution for predicting \(\textit{MFPT}\) for random walks in inhomogeneous networks. This methodology’s potential is demonstrated through simulated random walks and with a case study using the dataset of past cyclone tracks over the North Atlantic Ocean. The predictions using the presented method are compared to real data averages and predictions assuming homogeneous transport properties.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agliari E, Burioni R (2009) Random walks on deterministic scale-free networks: exact results. Phys Rev E 80(3):031125

    Article  Google Scholar 

  2. Godec A, Metzler R (2015) Optimization and universality of Brownian search in quenched heterogeneous media. arXiv preprint arXiv:150300558

  3. Noh JD, Rieger H (2004) Random walks on complex networks. Phys Rev Lett 92(11):118701

    Article  Google Scholar 

  4. Sood V, Redner S, Ben-Avraham D (2005) First-passage properties of the Erdös-Renyi random graph. J Phys Math Gen 38(1):109

    Article  Google Scholar 

  5. Roy C, Kovordányi R (2012) Tropical cyclone track forecasting techniques-a review. Atmos Res 104:40–69

    Article  Google Scholar 

  6. Zerger A, Wealands S (2004a) Beyond modelling: linking models with GIS for flood risk management. Nat Hazards 33(2):191–208

    Article  Google Scholar 

  7. Anderson HE (1983) Predicting wind-driven wild land fire size and shape. US Department of Agriculture, Forest Service, Intermountain Forest and Range Experiment Station

    Google Scholar 

  8. Achtemeier GL, Goodrick SA, Liu Y (2012) Modeling multiple-core updraft plume rise for an aerial ignition prescribed burn by coupling daysmoke with a cellular automata fire model. Atmosphere 3(3):352–376

    Article  Google Scholar 

  9. Aparicio JP, Pascual M (2007) Building epidemiological models from R0: an implicit treatment of transmission in networks. Proc Biol Sci 274(1609):505–512

    Article  Google Scholar 

  10. Colizza V, Vespignani A (2007) Invasion threshold in heterogeneous metapopulation networks. Phys Rev Lett 99(14):148701

    Article  Google Scholar 

  11. Kurella V, Tzou JC, Coombs D, Ward MJ (2015) Asymptotic analysis of first passage time problems inspired by ecology. Bull Math Biol 77(1):83–125

    Article  Google Scholar 

  12. Giuggioli L, Pérez-Becker S, Sanders DP (2013) Encounter times in overlapping domains: application to epidemic spread in a population of territorial animals. Phys Rev Lett 110(5):058103

    Article  Google Scholar 

  13. Condamin S, Benichou O, Tejedor V, Voituriez R, Klafter J (2007b) First-passage times in complex scale-invariant media. Nature 450(7166):77–80

    Article  Google Scholar 

  14. Tejedor V, Benichou O, Voituriez R (2011) Close or connected: distance and connectivity effects on transport in networks. Phys Rev E 83(6):066102

    Article  Google Scholar 

  15. Wijesundera I, Nirmalathas T, Halgamuge MN, Nanayakkara T, mfpt calculation for random walks in inhomogeneous networks. Under Review

    Google Scholar 

  16. Ferguson NM, Keeling MJ, Edmunds WJ, Gant R, Grenfell BT, Amderson RM, Leach S (2003) Planning for smallpox outbreaks. Nature 425(6959):681–685. doi:10.1038/nature02007

    Article  Google Scholar 

  17. Ben-Avraham D, Havlin S (2000) Diffusion and reactions in fractals and disordered systems. Cambridge University Press, Cambridge

    Book  Google Scholar 

  18. Finney M, Station RMR (1998) FARSITE. Fire Area Simulator-model development and evaluation, US Department of Agriculture, Forest Service, Rocky Mountain Research Station

    Google Scholar 

  19. Reynolds D (2009) Gaussian mixture models, Springer US, book section 196, pp 659–663. doi:10.1007/978-0-387-73003-5_196

    Google Scholar 

  20. González-Fierro M, Hernández-García D, Nanayakkara T, Balaguer C (2015) Behavior sequencing based on demonstrations: a case of a humanoid opening a door while walking. Adv Robot 29(5):315–329

    Article  Google Scholar 

  21. Celeux G, Soromenho G (1996) An entropy criterion for assessing the number of clusters in a mixture model. J Classif 13(2):195–212

    Article  Google Scholar 

  22. Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255

    Article  Google Scholar 

  23. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol 4, pp 1942–1948. doi:10.1109/ICNN.1995.488968

  24. Eberhart RC, Shi Y (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of the congress on evolutionary computation, vol 1. IEEE, pp 81–86

    Google Scholar 

  25. Perra N, Baronchelli A, Mocanu D, Gonçalves B, Pastor-Satorras R, Vespignani A (2012) Random walks and search in time-varying networks. Phys Rev Lett 109(23):238701

    Article  Google Scholar 

  26. Chris Landsea JF, Beven J (2014) Atlantic hurricane database (HURDAT2) 1851-2014

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Isuri Wijesundera .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this chapter

Cite this chapter

Wijesundera, I., Halgamuge, M.N., Nanayakkara, T., Nirmalathas, T. (2016). Calculating MFPT for Processes Mapping into Random Walks in Inhomogeneous Networks. In: Natural Disasters, When Will They Reach Me?. Springer Natural Hazards. Springer, Singapore. https://doi.org/10.1007/978-981-10-1113-9_5

Download citation

Publish with us

Policies and ethics