Loading...
Please wait, while we are loading the content...
Similar Documents
Lectures 16-17: Random Walks on Graphs 1.1 Hitting times and Cover Times
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lee, James R. |
| Copyright Year | 2015 |
| Abstract | Let G (V, E) be an undirected graph. The random walk on G is a Markov chain on V that, at each time step, moves to a uniformly random neighbor of the current vertex. Ffsor x ∈ V , use dx to denote the degree of vertex x. Then more formally, random walk on G is the following process {Xt}. We start at at some node X0 v0 ∈ V . Then if Xt v, we put Xt+1 w with probability 1/dv for every neighbor w of v. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://homes.cs.washington.edu/~jrl/teaching/cse525wi15/lectures/lecture16.pdf |
| Alternate Webpage(s) | https://homes.cs.washington.edu/~jrl/teaching/cse525wi15/lectures/lecture16.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
