Sebastian Rosengren: The dynamic Erdös-Rényi graph model
Time: Fri 2016-02-26 15.15 - 16.15
Location: Room 306, building 6, Kräftriket, Department of mathematics, Stockholm University
Participating: Sebastian Rosengren
In this talk we formulate the dynamic Erdös-Rényi graph model---in which one independently for each vertex pair add and remove edges according to a birth-death process.
In studying the dynamic graph we present two main results, the first being on how long it takes for the graph to reach stationarity. We give
an explicit expression for this time, as well as proving that this is the fastest time to reach stationarity---among all strong stationary times.
The second result concerns the time it takes for the dynamic graph to reach a certain number of edges. We give an explicit expression for the expected value of such a time, as well as study its asymptotic behavior when the number of edges is equal to a constant times the number of vertices present in the graph.