|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 listsSocial and Developmental Psychology (SDP) Seminar Series Data Insights Cambridge Philosophy Events
Other talksDeveloping Sustainable Architecture Logic programming beyond Prolog The formation of a core periphery structure in heterogeneous financial networks Controller Design of a Grid-tie Inverter to Enhance Fault-Ride-Through Capability Postcapitalist practices of communing and a performative politics of assemblage The human leukaemia virus HTLV-1: clonality, latency and immune response.