Thursday, October 24
|
09:30 |
Registration, welcoming coffee |
|
10:30 |
Conference opening - Andrei Raigorodsky |
|
11:00 |
Basic epidemiology of complex networks Sergey Dorogovtsev |
|
12:30 |
Coffee break |
|
13:00 |
Component structure of the vacant set induced by a random walk on a random graph Colin Cooper |
|
14:30 |
Lunch |
|
15:30 |
Systemic interbank network risks in Russia Andrei Leonidov |
|
16:10 |
Extensions of the 'hitchhiker' game-theoretic network formation model Daniil Musatov |
|
16:50 |
Coffee break |
|
17:20 |
Evolution of the Media Web Egor Samosvat |
Friday, October 25
|
10:00 |
Registration, welcoming coffee |
|
10:30 |
The power of locality for network algorithms Jennifer Tour Chayes |
|
12:00 |
Convergence of sparse graphs as a problem at the intersection of graph theory, statistical physics and probability Christian Borgs |
|
13:30 |
Lunch |
|
14:30 |
Statistics of a random graph in the Bollobas-Borgs-Chayes-Riordan model Evgeny Grechnikov |
|
15:10 |
Graph-based semi-supervised learning methods: Comparison and tuning Konstantin Avrachenkov |
|
15:50 |
Coffee break |
|
16:20 |
Generalized preferential attachment Liudmila Ostroumova |
Saturday, October 26
|
10:00 |
Registration, welcoming coffee |
|
10:30 |
Scale-free percolation Remco William van der Hofstad |
|
12:00 |
Limits of local algorithms for sparse random graphs David Gamarnik |
|
13:30 |
Lunch |
|
14:30 |
" When does zero-one k-law hold?" Maksim Zhukovskii |
|
15:10 |
Degree-degree dependencies in random graphs with heavy-tailed degrees Nelly Litvak |
|
15:50 |
Coffee break |
|
16:20 |
An in-depth look at preferential attachment model of the web: degree and edge distributions Gleb Gusev |
|
17:00 |
Conference closure - Andrei Raigorodsky |