Probability Seminar: Social Connectivity - Coalescence process of connected components of a random (acquaintances) graph determined by collisions of random walks

Probability Seminar: Social Connectivity - Coalescence process of connected components of a random (acquaintances) graph determined by collisions of random walks

Probability Seminar
Sep 19, 2012, 03:00 PM - 04:00 PM | 332 Evans Hall | Date Changed
Jonathan Hermon, UC Berkeley
Joint work with Gady Kozma and Itai Benjamini - In this work we study questions related to the evolution of random social networks in various graphs. In particular we study the time it takes them to become connected and for a giant component to emerge. We do so by considering a model in which at time 0 we start several independent random walks on a finite or infinite connected graph. For...