University of Cambridge > > Probability > Group Walk Random Graphs

Group Walk Random Graphs

Add to your list(s) Download to your calendar using vCal

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

We introduce a model of “geometric” random graphs which is based on the behaviour of random walk on groups. Intricate connections to the Poisson boundary, effective conductance in electrical networks, and Sznitman’s random interlacements will be discussed.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity