Local functions of IID and amenability of finite graphs
Event details
| Date | 02.02.2026 |
| Hour | 14:00 › 15:00 |
| Speaker | Omer Tamuz, Caltech |
| Location | |
| Category | Conferences - Seminars |
| Event Language | English |
Joint work with Tom Hutchcroft and Olga Rospuskova.
We study finite graphs equipped with independent and identically distributed (i.i.d.) vertex labels. We consider local functions of these labels; that is, processes where the value at a vertex depends only on the labels in its neighborhood. We investigate whether the output of such functions can be highly correlated across the edges of the graph. Our main result shows that this is possible if and only if the graph is amenable, under the natural adaptation of amenability to the finite setting.
We study finite graphs equipped with independent and identically distributed (i.i.d.) vertex labels. We consider local functions of these labels; that is, processes where the value at a vertex depends only on the labels in its neighborhood. We investigate whether the output of such functions can be highly correlated across the edges of the graph. Our main result shows that this is possible if and only if the graph is amenable, under the natural adaptation of amenability to the finite setting.
Practical information
- General public
- Free
Organizer
- Nicolas Monod
Contact
- Nicolas Monod