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.

Downloads

Issue

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

Article ID

SPP-2007-PA-43

Section

Poster Session PA

Published

2007-10-24

How to Cite

[1]

ESM Garcia and JPH Esguerra, Mean first-passage time for random walks on circulant networks, Proceedings of the Samahang Pisika ng Pilipinas 25, SPP-2007-PA-43 (2007). URL: https://proceedings.spp-online.org/article/view/SPP-2007-PA-43.