Random Walks on Graphs - Computer Science - Yale University

Download PDF
25 downloads 0 Views 5MB Size Report
Comment
walk on G: we start at a node vo; if at the t-th step we are at a node Vt, we move neighbor of 04 with probability 1/d(v1). Clearly, the sequence of random nodes ...