A zero-one law for recurrence and transience of frog processes (Q2359743)

Let \(V\) be a countable infinite set. A frog configuration \((n,s)\) on \(V\) consist of initial frogs \(n=(n(x), x\in V)\), where \(n(x)\in \mathbb{N}_0:=\mathbb{N}\cup\{0\}\) represents the number of frogs at site \(x\) indexed by \(i=1,2,\dots\) which can be woken up and will be called initial frogs. Consider a collection of paths \(s=(s_j(x,i))_{ j\geq 0}\), \(x\in V\), \(i\geq 1\), where \(s_j(x,i)\in V\) denotes the position of the \(i\)-th frog originating at \(x\) after \(j\) steps. A site \(\nu\in V\) is said to be recurrent for a frog configuration \((n, s)\in\mathbb F\) if there are infinitely many distinct \(x\in W^v(n,s)\) for which there are \(i\in \{1,\dots, n(x)\}\) and \(j\geq 0\) such that \(s_j(x,i)=\nu\). Otherwise \(\nu\) is called transient for \((n, s)\). The authors investigate when the zero-one law for recurrence and transience holds.