This analysis extends findings on cost one actions in groups with Property (T), highlighting their significance in unimodular random graphs.
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, and extend it both to locally compact second countable groups and unimodular random graphs. We prove unimodular random graph analogues of the Connes--Weiss and Glasner--Weiss theorem characterising Property (T).
No takes yet. Share an insight, caveat, or question.
Grabowski et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: