Mean first-passage time for random walks on circulant networks

Authors

  • Emmanuel Soliman M. Garcia ⋅ PH National Institute of Physics, University of the Philippines Diliman
  • Jose Perico H. Esguerra ⋅ PH National Institute of Physics, University of the Philippines Diliman

Abstract

We use the tools of spectral graph theory and the properties of circulant matrices to obtain exact, explicit, and compact analytical expressions for the following characteristics of the random walk on arbitrary finite undirected circulant networks: 1) The transition probability to go from one node to another in a certain number of steps, and 2) the mean first-passage time (MFPT) between a pair of distinct nodes.

SPP 2007 Proceedings Cover

Downloads

Published

2007-10-24

Issue

2007: Proceedings of the 25th Samahang Pisika ng Pilipinas Physics Congress

Section

Poster Session PA

License

Copyright License Agreement for Full Articles

How to Cite

[1]
“Mean first-passage time for random walks on circulant networks”, Proc. SPP, vol. 25, no. 1, p. SPP-2007-PA-43, Oct. 2007, Accessed: May 02, 2026. [Online]. Available: https://proceedings.spp-online.org/article/view/SPP-2007-PA-43