| COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Probability > Invariant and unimodular measures in the theory of random graphs
Invariant and unimodular measures in the theory of random graphsAdd to your list(s) Download to your calendar using vCal
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 listsResearch Seminar Series, Faculty of Education, University of Cambridge Sir Brian Pippard Memorial Meeting Spring School 2010 - 'Axon-Glia Biology in Health and Disease'Other talksRemodelling of membrane compartments Nematic braids: Effects of chirality and confinement Universality for Moving Stripes: A Hydrodynamic Theory of Polar Active Smectics Innate lymphoid cells in immunity and disease Object handling session Cambridge Assessment Network: Validity and the value of educational assessments |