8 citations · 24 across the 14 of their papers we have counts for
21 papers
Finite index extensions of treeable equivalence relations are treeable
Ruiyuan Chen, Anush Tserunyan, Robin Tucker-Drob
We prove that every countable Borel equivalence relation containing a finite index Borel treeable subequivalence relation is Borel treeable. This answers a long-standing question o…
Bounded chaining in measurable dynamics
Anush Tserunyan, Jenna Zomback
We introduce a one-parameter family of notions between double ergodicity and metric ergodicity for measure-class preserving (i.e., nonsingular) actions of countable groups on stand…
The Radon--Nikodym topography of acyclic measured graphs
Anush Tserunyan, Robin Tucker-Drob
We study locally countable acyclic measure-class-preserving (mcp) Borel graphs by analyzing their "topography" -- the interaction between the geometry and the associated Radon--Nik…
Heavy repulsion of clusters in Bernoulli percolation
Sasha Bell, Tasmin Chu, Owen Rodgers +2
We study Bernoulli percolation on (non)unimodular quasi-transitive graphs and prove that, almost surely, for any two heavy clusters and , the set of vertices in wi…
Tree-like graphings, wallings, and median graphings of equivalence relations
Ruiyuan Chen, Antoine Poulin, Ran Tao +1
We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypothe…
Nonamenable subforests of multi-ended quasi-pmp graphs
Ruiyuan Chen, Grigory Terlov, Anush Tserunyan
We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikody…