Cargèse fall school on random graphs
Cargèse (Corsica), September 20-26, 2015
The school is supported by the following institutions:
Program
MONDAY SEPTEMBER 21
09h00-10h30 Tomasz Łuczak (Adam Mickiewicz University Poznań): Introduction to random graphs
Slides
10h30-11h00 COFFEE BREAK
11h00-12h30 Mike Molloy (Univ. of Toronto): Configuration model and k-cores (1)
12h30-14h00 LUNCH BREAK
14h00-15h30 Mike Molloy (Univ. of Toronto): Configuration model and k-cores (2)
15h30-16h00 COFFEE BREAK
16h00-17h30 Paweł Prałat (Univ. Ryerson): the SPA model
Slides
TUESDAY SEPTEMBER 22
09h00-10h30 Tobias Müller (Univ. Utrecht): Random geometric graphs (1)
10h30-11h00 COFFEE BREAK
11h00-12h30 Tobias Müller (Univ. Utrecht): Random geometric graphs (2)
12h30-14h00 LUNCH BREAK
14h00-16h00 Marc Noy (UPC Barcelona): Random graphs from constrained classes of graphs
16h00-16h30 COFFEE BREAK
16h30-17h30 Open Problems Session
WEDNESDAY SEPTEMBER 23
09h00-10h30 Charles Bordenave (CNRS, Univ. Toulouse): Spectra of random graphs (1)
Slides
10h30-11h00 COFFEE BREAK
11h00-12h30 Charles Bordenave (CNRS, Univ. Toulouse): Spectra of random graphs (2)
12h30-14h00 LUNCH BREAK
FREE AFTERNOON
THURSDAY SEPTEMBER 24
09h00-10h30 Oriol Serra (UPC Barcelona): On the Lovász Local Lemma
Slides
10h30-11h00 COFFEE BREAK
11h00-12h30 Tomasz Łuczak (Adam Mickiewicz University Poznań): Random groups
Slides
12h30-14h00 LUNCH BREAK
14h00-15h30 Gábor Lugosi (ICREA, Univ. Pompeu Fabra): A high-dimensional random graph process
Slides
15h30-16h00 COFFEE BREAK
16h00-17h30 Paweł Prałat (Univ. Ryerson): On the small subgraph conditioning method
Slides
FRIDAY SEPTEMBER 25
09h00-10h30 Florent Krzakala (ENS Paris): Colorings of random graphs (1)
10h30-11h00 COFFEE BREAK
11h00-12h30 Lenka Zdeborová (CNRS, CEA Saclay): Colorings of random graphs (2)
12h30-14h00 LUNCH BREAK
14h00-15h30 Amin Coja-Oghlan (Goethe-Univ. Frankfurt): Colorings of random graphs (3)
Slides
15h30-16h00 COFFEE BREAK
16h00-17h30 Cyril Banderier (CNRS, Univ. Paris 13): Airy limit laws and mean analysis of NP-complete problems: the phenomenon n^ln n
Back to the main page