Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

SIAMDM
2010

favoriteEmaildiscussreport

119views more SIAMDM 2010»

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

13 years 5 months ago

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

Download people.virginia.edu

In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected hitting time from an arbitrary spanning tree of the graph. We illustrate this method with two examples. In these examples, we show that the bounds obtained from the spanning method are sharper than bounds obtained from other commonly used techniques.

Randy Cogill, Cheng Peng

Real-time Traffic

Arbitrary Spanning Tree | Hitting Time | SIAMDM 2010 | Upper Bound |

claim paper

Related Content

» Faster Generation of Random Spanning Trees

» Graph Matching using Commute Time Spanning Trees

» Clustering via Random Walk Hitting Time on Directed Graphs

» Random Spanning Trees and the Prediction of Weighted Graphs

» Tight Bounds for the Cover Time of Multiple Random Walks

» Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs

» Covering minimum spanning trees of random subgraphs

» Parametric and Kinetic Minimum Spanning Trees

» Expanders are universal for the class of all spanning trees

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Randy Cogill, Cheng Peng

Comments (0)