17 citations · 64 across the 27 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.PR2023
Characterizations of amenability through stochastic domination and finitary codings
Gourab Ray, Yinon Spinka
We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors). On the sto…
math.PR2023★ 1 cited
Random walks on regular trees can not be slowed down
Omer Angel, Jacob Richey, Yinon Spinka +1
A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutatio…