most citedMoser-Tardos Algorithm with small number of random bits

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing math.GRShow all

1 paper · 1 filter

math.GR2025

Unimodular random graphs with Property (T) have cost one

Łukasz Grabowski, Héctor Jardón-Sánchez, Sam Mellick

Hutchcroft and Pete showed that countably infinite groups with Property (T) admit cost one actions, resolving a question of Gaboriau. We give a streamlined proof of their theorem,…