|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Invariant and unimodular measures in the theory of random graphs
If you have a question about this talk, please contact neb25.
Dealing with random infinite graphs inevitably leads to a study of invariance properties of the associated measures on the space of rooted graphs. In this context there are two natural notions: that of measures invariant with respect to the “root moving” equivalence relation (based on ideas from ergodic theory and geometry of foliations) and that of unimodular measures recently introduced by probabilists. I will give a brief survey of the area, and, in particular, clarify the relationship between these two classes of measures.
This talk is part of the Probability series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCambridge Cleantech Cambridge Centre for Risk Studies Cambridge Area Sequencing Informatics Meeting VII (2015)
Other talksDomain architecture in the Drosophila genome Professor Geoffrey L Smith: Modulation of CD8+ T cell and NK cell memory by vaccinia virus Giant Volcanic Intrusions The Inaugural CSAS Lecture on South Asian Public Affairs - Looking away: inequality, prejudice and indifference in new India Can the UK cook its way to better health? Advancing Creativities Research: Making Connections across Diverse Settings