分野別セミナー

講演要旨：
We consider two random walks conditioned
"never to intersect" in $\mathbb 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 $\mathbb Z^{2} $and
show the subdiffusivity of the simple random
walk on this graph.