MFPT calculation for random walks in inhomogeneous networks
DOI10.1016/J.PHYSA.2016.06.015zbMath1400.60120OpenAlexW2462636553WikidataQ57601619 ScholiaQ57601619MaRDI QIDQ1619942
Isuri Wijesundera, Thrishantha Nanayakkara, Ampalavanapillai Nirmalathas, Malka N. Halgamuge
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://kclpure.kcl.ac.uk/portal/en/publications/mfpt-calculation-for-random-walks-in-inhomogeneous-networks(f69fc458-8142-44c5-a39e-6d770613d6c1).html
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (1)
Cites Work
- Unnamed Item
- An entropy criterion for assessing the number of clusters in a mixture model
- Epidemic spreading driven by biased random walks
- Robustness analysis of static routing on networks
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Asymptotic analysis of first passage time problems inspired by ecology
- A Guide to First-Passage Processes
- Diffusion and Reactions in Fractals and Disordered Systems
- Active transport improves the precision of linear long distance molecular signalling
- First-passage properties of the Erdos–Renyi random graph
This page was built for publication: MFPT calculation for random walks in inhomogeneous networks