We consider the random walk on Z+ = {0, 1, ...} , with up and down transition probabilities given the chain is in state x {1, 2, ...}: (1) px = 1 2 ,, 1 2x +
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...