Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...
We define a way of approximating actions on measure spaces using finite graphs. We then show that in quite general settings these graphs form a family of expanders if and only if the action is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback