STAR Workshop on Random Graphs 2017.
Preliminary Schedule
Thursday, 26 January 2017
| 09:00-09:25 | Coffee and registration (David de Wiedgebouw 1.30) |
| 09:25-09:30 | Opening |
| 09:30-10:15 | Mihyun Kang, Homological connectivity of random hypergraphs |
| 10:15-10:45 | Break |
| 10:45-12:00 |
Nicos Starreveld, Dynamic Erdös-Rényi graphs Sander Dommers, Metastability of the Ising model on random regular graphs at zero temperature Adam Lipowski, Agreement dynamics on random graphs |
| 12:00-13:45 | Lunch |
| 13:45-14:30 | Daniel Valesin, Spatial Gibbs random graphs |
| 14:30-14:45 | Break |
| 14:45-16:00 |
Henk Don, Non-negative matrix factorization in the SIS model Angelica Pachon, On the continuous-time limit of the Barabási-Albert random graph Angus Davidson, The Robot Crawler Model |
| 16:00-16:15 | Break |
| 16:15-17:00 | Vincent Tassion, Sharpness results via randomized algorithms |
| 17:00- | Reception and buffet (Math Library in Hans Freudenthalgebouw) |
Friday, 27 January 2017
| 09:15-09:30 | Coffee (David de Wiedgebouw 1.30) |
| 09:30-10:15 | Marián Boguñá, Toward a cosmological theory of complex networks |
| 10:15-10:45 | Break |
| 10:45-12:00 |
Merlijn Staps, The diameter of hyperbolic random graphs Pim van der Hoorn, Generating maximally disassortative graphs with a given degree distribution Clara Stegehuis, Clustering in random graphs with natural cutoffs and single-edge constraints |
| 12:00-13:45 | Lunch |
| 13:45-15:00 |
Sergey Frenkel, Random graphs based model for malware detection Lorenzo Taggi, Random permutations on graphs Rajko Nenadov, Optimal induced universal graphs for bounded-degree graphs |
| 15:00-15:15 | Break |
| 15:15-16:00 | Nick Wormald, The probability of nonexistence of a subgraph in a moderately sparse random graph |
| 16:00- | Drinks reception (David de Wiedgebouw 1.30) |