| ▲ | JohnKemeny 3 days ago | ||||||||||||||||
Here's a reference for the definition I'm using: https://www.cs.yale.edu/homes/spielman/561/lect10-18.pdf It's from lecture notes (pdf) from a course in Spectral Graph Theory by Professor Daniel Spielman at Yale. | |||||||||||||||||
| ▲ | seanhunter 3 days ago | parent [-] | ||||||||||||||||
Those notes look interesting thanks. I’ve really never heard of someone saying you have to have uniform probability for a random walk on a graph. In fact the context where I’m most familiar with them (lattice/grid pricers) it’s always specified something like “the probability of branch a is p and b is 1-p” (ie explicitly not uniform) and they aren’t a weighted graph in the normal sense. | |||||||||||||||||
| |||||||||||||||||