University of Cambridge > Talks.cam > Probability > Invariant and unimodular measures in the theory of random graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Invariant and unimodular measures in the theory of random graphs

Download to your calendar using vCal

If you have a question about this talk, please contact .

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 lists

Average on weekdays: 9007.0984456 kWh Mill Lane Cambridge Lecture Room 9 Marine/Wolfson Building lecture hall, Bullard Labs.

Other talks

Director's Welcome Talk TBC Using numerical simulations for solving spectral geometry problems Group Work Harnessing Radical Reactivity for Molecular Innovation TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity