Loading...
Please wait, while we are loading the content...
Similar Documents
Spectral Graph Theory and Its Applications 7.1 Random Walks on Weighted Graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Spielman, Daniel A. |
| Copyright Year | 2004 |
| Abstract | We now define random walks on weighted graphs. We will let A denote the adjacency matrix of a weighted graph. We will also the graph to have self-loops, which will correspond to diagonal entries in A. Thus, the only restriction on A is that is be symmetric and non-negative. When our random walk is at a vertex u, it will go to node v with probability proportional to au,v: mu,v def = au,v ∑ w au,w . |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-math.mit.edu/~spielman/eigs/lect7.pdf |
| Alternate Webpage(s) | http://www.cs.cmu.edu/afs/cs/user/glmiller/public/Scientific-Computing/F-07/RelatedWork/Spielman-lect7.pdf |
| Alternate Webpage(s) | http://www.cs.yale.edu/homes/spielman/eigs/lect7.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
