Analysis and Probability Seminar
Tony Johansson, Chalmers: Spanning structures in non-homogeneous random graphs
Random graphs are often used to model real-world networks, for example the underlying social networks in some models of infectious disease outbreaks. The suitability of most models can be questioned, for two main reasons. One is clustering, absent from most random graph models, and one is degree heterogeneity, which has been addressed more in recent times by models such as the configuration model and preferential attachment models. In this talk I will discuss ways of working with non-homogeneous random graphs, focusing on the perfect matching and Hamilton cycle problems, as well as the potential of getting rid of anti-clustering conditions in some well-established proofs.
The seminar will be held both in seminar room and via zoom. Members of the department will receive the link and password via mail. Others interested are welcome to attend and can get the link by contacting one of the organisers (please inform us who you are).
Organisers: Jakob Björnberg (firstname.lastname@example.org), Erik Broman (email@example.com) and Genkai Zhang (firstname.lastname@example.org). Please contact us if you wish to be informed of future seminars.
MV:L14, Chalmers tvärgata 3, and online