Research PapersNo Access

Random walks on real metro systems

Yueying Zhu

IMMM, UMR CNRS 6283, Université du Maine, 72085 Le Mans, France

Complexity Science Center & Institute of Particle Physics, Central China Normal University, Wuhan 430079, P. R. China

E-mail Address: zhu@ismans.fr

Search for more papers by this author

Longfeng Zhao

Complexity Science Center & Institute of Particle Physics, Central China Normal University, Wuhan 430079, P. R. China

Search for more papers by this author

Wei Li

Complexity Science Center & Institute of Particle Physics, Central China Normal University, Wuhan 430079, P. R. China

Max-Planck Institute for Mathematics in the Sciences, Inselst. 22, 04103, Germany

Search for more papers by this author

Qiuping A. Wang

IMMM, UMR CNRS 6283, Université du Maine, 72085 Le Mans, France

Search for more papers by this author

, and

Xu Cai

Complexity Science Center & Institute of Particle Physics, Central China Normal University, Wuhan 430079, P. R. China

Search for more papers by this author

https://doi.org/10.1142/S0129183116501229Cited by:2 (Source: Crossref)

Abstract

In this paper, we investigate the random walks on metro systems in 28 cities from worldwide via the Laplacian spectrum to realize the trapping process on real systems. The average trapping time is a primary description to response the trapping process. Firstly, we calculate the mean trapping time to each target station and to each entire system, respectively. Moreover, we also compare the average trapping time with the strength (the weighted degree) and average shortest path length for each station, separately. It is noted that the average trapping time has a close inverse relation with the station’s strength but rough positive correlation with the average shortest path length. And we also catch the information that the mean trapping time to each metro system approximately positively correlates with the system’s size. Finally, the trapping process on weighted and unweighted metro systems is compared to each other for better understanding the influence of weights on trapping process on metro networks. Numerical results show that the weights have no significant impact on the trapping performance on metro networks.

Keywords:

PACS Nos.: 05.40.Fb, 05.60.−k, 05.90.+m

You currently do not have access to the full text article.
Recommend the journal to your library today!

References

1. O. Biham, A. A. Middleton and D. Levine, Phys. Rev. A 46 (1992) R6124. Web of Science, ADS, Google Scholar
2. K. Nagel and M. Schreckenberg, J. Phys. I 2 (1992) 2221. Web of Science, ADS, Google Scholar
3. B. S. Kerner and P. Konhäuser, Phys. Rev. E 48 (1993) R2335. Web of Science, ADS, Google Scholar
4. M. Perc, New J. Phys. 9 (2007) 3. Web of Science, Google Scholar
5. D. Helbing, M. Schönhof and D. Kern, New J. Phys. 4 (2002) 33. Web of Science, Google Scholar
6. D. Helbing, Dynamic decision behavior and optimal guidance through information services: Models and experiments, Human Behaviour and Traffic Networks (Springer, Berlin, 2004). Google Scholar
7. N. Geroliminis and C. F. Daganzo, Transp. Res. B 42 (2008) 759. Google Scholar
8. D. Helbing, Eur. Phys. J. B 70 (2009) 229. Web of Science, ADS, Google Scholar
9. F. Yan, F. Tian and Z. Shi, Physica A 445 (2016) 117. Web of Science, ADS, Google Scholar
10. K. Pearson, Nature 72 (1905) 294. ADS, Google Scholar
11. N. G. Van Kampen, Stochastic Processes in Physics and Chemistry revised and enlarged edition (North-Holland, Amsterdam, 1992). Google Scholar
12. P. G. De Gennes, Scaling Concepts in Polymer Physics (Cornell University Press, Ithaca and London, 1979). Google Scholar
13. M. Doi and S. F. Edwards, The Theory of Polymer Dynamics (Clarendon Press, Oxford, 1986). Google Scholar
14. N. W. Goel and N. Richter-Dyn, Stochastic Models in Biology (Academic Press, New York, 1979). Google Scholar
15. M. Perc, J. R. Soc. Interface 11 (2014) 20140378. Web of Science, Google Scholar
16. J. R. Norris, Markov Chains (Cambridge University Press, Cambridge, 1998). Google Scholar
17. L. Lovász, Combinatorics, Paul Erdos is Eighty Vol. 2 (1993), pp. 1–46. Google Scholar
18. L. Guo, Y. Zhu, Z. Luo and W. Li, Fractals 21 (2013) 1350010. Link, Web of Science, ADS, Google Scholar
19. G. Palla, I. J. Farkas, P. Pollner, I. Derényi and T. Vicsek, New J. Phys. 9 (2007) 186. Web of Science, Google Scholar
20. S. P. Meyn and L. Tweedie, Tokyo J. Math. 12 (1989) 1. Google Scholar
21. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs (2002). Google Scholar
22. M. L. Silverstein, Ann. Probab. 2 (1974) 681. Web of Science, Google Scholar
23. J. Folkman, J. Comb. Theory 3 (1967) 215. Google Scholar
24. D. Coppersmith, P. Tetali and P. Winkler, SIAM J. Discrete Math. 6 (1993) 363. Web of Science, Google Scholar
25. A. R. Conway and A. J. Guttmann, Phys. Rev. Lett. 77 (1996) 26. Web of Science, Google Scholar
26. S. Jespersen, I. M. Sokolov and A. Blumen, Phys. Rev. E 62 (2000) 4405. Web of Science, ADS, Google Scholar
27. J. D. Noh and H. Rieger, Phys. Rev. Lett. 92 (2004) 118701. Web of Science, ADS, Google Scholar
28. F. Fouss, A. Pirotte, J. M. Renders and M. Saerens, IEEE Trans. Knowl. Data Eng. 19 (2007) 3. Web of Science, Google Scholar
29. Z. Zhang, T. Shan and G. Chen, Phys. Rev. E 87 (2000) 012112. Web of Science, Google Scholar
30. Y. Lin and Z. Zhang, Phys. Rev. E 87 (2013) 062140. Web of Science, ADS, Google Scholar
31. P. Pons and M. Latapy, J. Graph Algorithms Appl. 10 (2006) 191. Google Scholar
32. M. Rosvall and C. T. Bergstrom, Proc. Natl. Acad. Sci. 105 (2007) 1118. Web of Science, ADS, Google Scholar
33. W. Li, J. Gu, S. Liu, Y. Zhu, S. Deng, L. Zhao, J. Han and X. Cai, arXiv:1403.7844. Google Scholar
34. F. R. K. Chung, Spectral Graph Theory (American Mathematical Society, Providence, 1997). Google Scholar
35. P. V. Mieghem, Graph Spectra for Complex Networks (Cambridge University Press, Cambridge, 2011). Google Scholar