Epidemics and percolation in weighted random graphs
Event details
| Date | 25.10.2012 |
| Hour | 11:15 › 12:15 |
| Speaker | Dr. Hamed Amini |
| Location | |
| Category | Conferences - Seminars |
In the first part, we study the impact of edge weights on distances in random graphs. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest weight path between a random vertex and all others (the flooding time), as well as the (weighted) diameter of sparse random graphs, when the edge weights are i.i.d. exponential random variables.
In the second part, we analyze bootstrap percolation process (and extensions) on some random graphs. A bootstrap percolation process on a graph G is an ``infection" process which evolves in rounds. Initially, there is a subset of infected nodes and, with a given threshold r, in each subsequent round each uninfected node which has at least r infected neighbors becomes infected and remains so forever. Such processes have been used as models to describe several complex phenomena in diverse areas, from jamming transitions and magnetic systems to neuronal activity and spread of defaults in banking systems.
In the second part, we analyze bootstrap percolation process (and extensions) on some random graphs. A bootstrap percolation process on a graph G is an ``infection" process which evolves in rounds. Initially, there is a subset of infected nodes and, with a given threshold r, in each subsequent round each uninfected node which has at least r infected neighbors becomes infected and remains so forever. Such processes have been used as models to describe several complex phenomena in diverse areas, from jamming transitions and magnetic systems to neuronal activity and spread of defaults in banking systems.
Practical information
- General public
- Free
Organizer
- Prof. Charles Pfister
Contact
- Le Chen