3 ms·

Here's a reference for the definition I'm using: https://www.cs.yale.edu/homes/spielman/561/lect10-18.pdf https://www.cs.yale.edu/homes/spielman/561/lect10-18.

• seanhunter 2y ago
  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.
  • srean 2y ago
    It doesn't have to be uniform or memory less. However, in general when people mention random walks without further qualifications they are usually talking about the uniform and memoryless case. That vanilla case can be generalized extensively, on kinds of state spaces, kinds of index sets, kinds of dependence and so on.
    • seanhunter 2y ago
      That makes sense. THanks.