University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Dynamical Models of Random Simplicial Complexes

Dynamical Models of Random Simplicial Complexes

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

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

Models of scale free random graphs are ubiquitous in their application to network science. Such models encode information about interactions between pairs of vertices, but mechanisms that encode interactions be- tween multiple vertices are less well studied. In this context, recently a number of authors (such as Bianconi and Rahmede) have paid special attention to random evolving simplicial complexes as a suitable model. Motivated by this, we introduce general dynamical models of random simplicial complexes and derive a formula for the asymptotic degree dis- tribution. This asymptotic formula generalises results for a number of existing models, including random Apollonian networks and the weighted random recursive tree. Joint work with Nikolaos Fountoulakis, C├ęcile Mailler and Henning Sulzbach.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.