BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Epidemics and percolation in weighted random graphs
DTSTART:20121025T111500
DTEND:20121025T121500
DTSTAMP:20260509T115313Z
UID:a9e227baa7b4b388e3b81bb4cc750d6bad356563ad652a4d8bf7cb72
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Hamed Amini\nIn the first part\, we study the impact of e
 dge weights on distances in random graphs. Our main result consists of a p
 recise 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 weight
 s are i.i.d. exponential random variables.\n\nIn the second part\, we anal
 yze bootstrap percolation process (and extensions) on some random graphs. 
 A bootstrap percolation process on a graph G is an ``infection" process wh
 ich evolves in rounds. Initially\, there is a subset of infected nodes and
 \, with a given threshold r\, in each subsequent round each uninfected nod
 e which has at least r infected neighbors becomes infected and remains so 
 forever. Such processes have been used as models to describe several compl
 ex phenomena in diverse areas\, from jamming transitions and magnetic syst
 ems to neuronal activity and spread of defaults in banking systems.
LOCATION:GRA 332  http://plan.epfl.ch/?room=GRA%20332
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR