The contact process on random graphs, via cumulative merging

Vortrag von Dr. Arvind Singh

Sprecher eingeladen von: Prof. Dr. Jean Bertoin

Datum: 08.03.17  Zeit: 17.15 - 19.00  Raum: Y27H12

The contact process is a classical interacting particle system which models the spread of a disease inside a network. For bounded degree graphs, there always exists a positive critical infection rate below which the infection vanishes almost-surely. On the other hand, if the graph has unbounded degree, it may happen that the infection survives for any infection rate. In this talk, I will introduce a percolation model on set of vertices of the graph called "cumulatively merged partition" and I will try to explain how the existence of an infinite cluster relates to the existence of a sub-critical infection phase for the contact process. Joint work with L. Ménard.