Mean first-passage time for random walks on circulant networks
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
Physics: Key to understanding nature
Liknayan: Susi sa pagtuklas ng kalikasan
24-26 October 2007, University of the Philippines Los BaƱos, Laguna