The contact process on random graphs, via cumulative merging
【2017.4.5 4:00pm, N613】 |
| 【大 中 小】【打印】【关闭】 |
2017-03-29
Colloquia & Seminars
|
Speaker
|
Dr. Arvind Singh, CNRS, University of Paris-Sud
|
|
Title
|
The contact process on random graphs, via cumulative merging
|
|
Time
|
2017.4.5 16:00-17:00
|
|
Venue
|
N613
|
|
Abstract
|
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 define a percolation model on the vertices of the graph called "cumulatively merged partition". 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.
|
|
Affiliation
|
|
  |
|
