Exceptional graphs for the random walk (Q2227475): Difference between revisions

This paper studies exceptional graphs for random walks on \(\mathbb{Z}^2\). If \(W\) is a simple random walk on \(\mathbb{Z}^2\), then there almost surely exists a random exceptional subgraph \(H \subseteq\mathbb{Z}^2\) for which the induced walk \(W_H\) visits each node reachable from the origin in \(H\) infinitely many times and fails to visit infinitely many nodes reachable from the origin in \(H\). The question of whether a countably infinite independent set of simple random walks almost surely has the property that at least one of these walks induces a recurrent walk over a given \(G\subseteq\mathbb{Z}^2\) is negatively answered in this paper either. Moreover, for \(d\in\mathbb{N}\) and \(W_i\) \((i\in S)\) being a set of random walks created by a branching random walk over \(\mathbb{Z}^d\) with a nontrivial offspring distribution, it is shown that almost surely for every spanning subgraph \(G\subseteq\mathbb{Z}^d\), there is a \(j\in S\) for which the induced walk \(W_j\) is recurrent.