Finitary random interlacements and the Gaboriau-Lyons problem (Q1999357): Difference between revisions

The author investigates the special case of orbit-equivalence relations arising from free actions of countable groups. He obtains interesting results in the case of arbitrary Bernoulli shifts over a nonamenable group, thus giving a positive answer to the question posed in the work by \textit{D. Gaboriau} and \textit{R. Lyons} [Invent. Math. 177, No. 3, 533--540 (2009; Zbl 1182.43002)]. It is known that an action \(\Gamma\curvearrowright(X, \mathcal{B},\mu)\) is von Neumann-Day if either \(\Gamma\) is amenable or the question posed by Gaboriau-Lyons admits a positive answer. \par In this paper the author proves the following theorem: \par Theorem. Let \(\Gamma\) be a countable nonamenable group and \((K, \kappa)\) a nontrivial probability space. Then the Bernoulli shift \(\Gamma\curvearrowright(K, \kappa)^{\Gamma}\) is von Neumann-Day. \par Let \(\Gamma\) be a nonamenable countable group with a finite generating set \(S\subset \Gamma\). Let \(G = (V,E)\) denote the associated Cayley graph. Let \(\Omega^{[0,\infty)}\) be a subspace of the space of all functions from \(\mathcal{W}[0,-\infty)\) to \(N\) endowed with the topology of pointwise convergence, where \(\mathbf{P}_{u,T}\) is a probability measure on \(\Omega^{[0,\infty)}\). The author obtains the following results: 1) For every \(\epsilon > 0\) there exists \(u_0>0\) such that if \(0<u< u_0\) and \(T > 0\) then the action \(\Gamma\curvearrowright(\Omega^{[0,\infty)}, \mathbf{P}_{u,T})\) is measurably conjugate to a Bernoulli shift over \(\Gamma\) with base entropy \(<\epsilon\). 2) For every \(u > 0\) there exists \(T_u\) such that if \(T > T_u\) then for \(\mathbf{P}_{u,T}\)-almost every \(\omega\), the subgraph \((V, \mathcal{E}_{\omega})\) has infinite clusters. 3) There exists \(u_c > 0\) such that if \(0 < u < u_c\) and \(T > T_u\) then for \(\mathbf{P}_{u,T}\)-almost every \(\omega\), the subgraph \((V, \mathcal{E}_{\omega})\) has infinitely many infinite clusters. 4) For any \(u, T > 0\), if \((V, \mathcal{E}_{\omega})\) has infinitely many infinite clusters \(\mathbf{P}_{u,T}\)-a.s. then each infinite cluster has infinitely many ends \(\mathbf{P}_{u,T}\)-a.s. Moreover if \(\omega\sim \mathbf{P}_{u,T}\) then the random subgraph \((V, \mathcal{E}_{\omega})\) has indistinguishable infinite clusters in the sense of \textit{R. Lyons} and \textit{O. Schramm} [Ann. Probab. 27, No. 4, 1809--1836 (1999; Zbl 0960.60013)]. Note that in the proofs the author uses an approximation to the random interlacement process by random multisets of geometrically-killed random walk paths.