Cut points for simple random walks

Daisuke Shiraishi
Tue, Jun 5, 2012
PIMS, University of British Columbia
PIMS-MPrime Summer School in Probability
We consider two random walks conditioned “never to intersect” in Z^2. We show that each of them has infinitely many `global' cut times with probability one. In fact, we prove that the number of global cut times up to n grows like n^{3/8}. Next we consider the union of their trajectories to be a random subgraph of Z^2 and show the subdiffusivity of the simple random walk on this graph.

You are missing some Flash content that should appear here! Perhaps your browser cannot display it, or maybe it did not initialize correctly.