Now showing items 1-1 of 1
On the Commute Time of Random Walks on Graphs
(Brazilian Journal of Probability and Statistics, 1995)
Given a simple random walk on an undirected connected graph, the commute time of the vertices x and y is defined as C(x,y) = ExTy+EyTx. We give a new proof, based on the optional sampling theorem for martingales, of the ...