REVIEW 1 cited by
Finitary random interlacements and the Gaboriau-Lyons problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The von Neumann-Day problem asks whether every non-amenable group contains a non-abelian free group. It was answered in the negative by Ol'shanskii in the 1980s. The measurable version (formulated by Gaboriau-Lyons) asks whether every non-amenable measured equivalence relation contains a non-amenable treeable subequivalence relation. This paper obtains a positive answer in the case of arbitrary Bernoulli shifts over a non-amenable group, extending work of Gaboriau-Lyons. The proof uses an approximation to the random interlacement process by random multistep of geometrically-killed random walk paths. There are two applications: (1) the Gaboriau-Lyons problem for actions with positive Rokhlin entropy admits a positive solution, (2) for any non-amenable group, all Bernoulli shifts factor onto each other.
Forward citations
Cited by 1 Pith paper
-
Percolation for the Finitary Random interlacements
For every u>0, finitary random interlacements on Z^d with d>=3 have no infinite component for small mean walk length T and a unique infinite component for large T.
Discussion (0). Continue with ORCID to comment.