University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On asymptotic exchangeability and graph evolution

On asymptotic exchangeability and graph evolution

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

If you have a question about this talk, please contact info@newton.ac.uk.

SNAW05 - Bayesian methods for networks

Co-author: Sandra Fortini (Bocconi University, Milano)

Reinforced processes are of interest in probability and in many related fields, and as preferential attachment schemes in graph modeling. In this talk, I will discuss some classes of reinforced processes with a random reinforcement. Randomly reinforced processes allow to extend the spectrum of application, to incorporate non stationary evolution, competition, selection and other forms of asymmetry. I will present some underlying theory and limit properties, including asymptotic exchangeability, and potential applications as weighted preferential attachment schemes in graph modeling. An interesting aspect is that, depending on the random weights' structure, a sub-region of the sample space may tend to dominate, possibly explaining sparsity phenomena in exchangeable graphs.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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