On the range of the simple random walk bridge on groups (2007)
Benjamini, Itai; Weizmann Institute Of Science; Itai.benjamini@gmail.com, Izkovsky, Roey; Weizmann Institute Of Science; Roey.izkovsky@gmail.com, Kesten, Harry; Cornell University; Kesten@math.cornell.edu
Abstract. Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the...
On the range of the simple random walk bridge on groups (2007)
Benjamini, Itai; Weizmann Institute Of Science; Itai.benjamini@gmail.com, Izkovsky, Roey; Weizmann Institute Of Science; Roey.izkovsky@gmail.com, Kesten, Harry; Cornell University; Kesten@math.cornell.edu
Abstract. Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the...
The Biham-Middleton-Levine traffic model for a single junction (2007)
Benjamini, Itai, Gurel-Gurevich, Ori, Izkovsky, Roey
In the Biham-Middleton-Levine traffic model cars are placed with some density p on a two dimensional torus, and move according to a (simple) set of predefined rules. Computer simulations show this...
On the range of the simple random walk bridge on groups (2006)
Benjamini, Itai, Izkovsky, Roey, Kesten, Harry
Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of...