Atelier «Combinatoire, randomisation, algorithmes et probabilités»4 au 8 mai 2009Programme |
|||
|
||||||||||
Le lundi 4 mai 2009 |
||||||||
|
|
||||||||
|
08:30 - 09:00
|
Café croissants
|
Salle 6245
|
|
08:45 - 09:00
|
Inscription
|
Salle 5345
|
|
Salle de réunion : 6214 |
|
09:00 - 09:05
|
Mots de bienvenue
|
|
|
09:05 - 09:55
|
Peter Winkler
(Dartmouth College) Coordinate Percolation | Résumé |
|
09:55 - 10:30
|
Pause-café
|
Salle 6245
|
|
10:30 - 11:20
|
Imre Leader
(University of Cambridge) Positive Projections | Résumé |
|
11:30 - 12:20
|
Tibor Szabó
(McGill University) Random graph intuition in positional games | Résumé |
|
12:20 - 14:00
|
Pause-déjeuner
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
14:00 - 14:50
|
Ravi Kannan
(Microsoft Research Labs.) A New Probability Inequality and Concentration Results | Résumé |
|
14:50 - 15:30
|
Pause-café
|
Salle 6245
|
|
15:30 - 16:20
|
Devdatt Dubhashi
(Göteborg University) Markov Chain Coupling for Stochastic Domination of Order Statistics | Résumé |
|
16:30 - 17:20
|
Michael Molloy
(University of Toronto) The Glauber Dynamics for Colourings of Bounded Degree Trees | Résumé |
|
17:20
|
Cocktail de bienvenue
|
Salle 6245
|
Le mardi 5 mai 2009 |
||||||||
|
|
||||||||
|
08:30 - 09:00
|
Café croissants
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
09:00 - 09:50
|
Van H. Vu
(Rutgers University) Random Matrices: A Survey | Résumé |
|
09:50 - 10:30
|
Pause-café
|
Salle 6245
|
|
10:30 - 11:20
|
Andrea Montanari
(Stanford University) Matrix Completion from Fewer Entries | Résumé |
|
11:30 - 12:20
|
Christina Goldschmidt
(University of Oxford) The Scaling Limit of Critical Rrandom Graphs | Résumé |
|
12:20 - 14:00
|
Pause-déjeuner
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
14:00 - 14:50
|
Pablo Augusto Ferrari
(Universidad de Buenos Aires) Quasi stationary distributions and Fleming Viot processes | Résumé |
|
14:50 - 15:30
|
Pause-café
|
Salle 6245
|
|
15:30 - 16:20
|
Nathanaël Berestycki
(University of Cambridge) Mixing Times of Random Walks Based on Conjugacy Classes of the Symmetric group | Résumé |
|
16:30 - 17:20
|
Ralph Neininger
(Goethe University) Probabilistic Analysis of the FIND Algorithm | Résumé |
Le mercredi 6 mai 2009 |
||||||||
|
|
||||||||
|
08:30 - 09:00
|
Café croissants
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
09:00 - 09:50
|
Jean-François Le Gall
(Université Paris-Sud Orsay) The Continuous Limit of Large Random Planar Map | Résumé |
|
09:50 - 10:30
|
Pause-café
|
Salle 6245
|
|
10:30 - 11:20
|
Nicolas Broutin
(INRIA Rocquencourt) The Height of Unlabelled Trees | Résumé |
|
11:30 - 12:20
|
Jean-François Marckert
(Université Bordeaux 1) The CRT is the Scaling Limit of Unordered Binary Trees | Résumé |
|
12:20 - 14:00
|
Pause-déjeuner
|
Salle 6245
|
|
14:00
|
Après-midi libre
|
Le jeudi 7 mai 2009 |
||||||||
|
|
||||||||
|
08:30 - 09:00
|
Café croissants
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
09:00 - 09:50
|
Alan Frieze
(Carnegie Mellon University) Packing Hamilton Cycles into Eps-regular Graphs and Hypergraphs | Résumé |
|
09:50 - 10:30
|
Pause-café
|
Salle 6245
|
|
10:30 - 11:20
|
Benny Sudakov
(UCLA ) Resilience of Random Graphs | Résumé |
|
11:30 - 12:20
|
Simon Griffiths
(Université de Montréal) The Unscaled Limit of Invasion Percolation | Résumé |
|
12:20 - 14:00
|
Pause-déjeuner
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
14:00 - 14:50
|
Peter Keevash
(Queen Mary, University of London) The Early Evolution of the H-free Process | Résumé |
|
14:50 - 15:30
|
Pause-café
|
Salle 6245
|
|
15:30 - 16:20
|
Dimitris Achlioptas
(University of California Santa Cruz) Algorithmic Phase Transitions in Constraint Satisfaction Problems | Résumé |
|
16:30 - 17:20
|
Po-Shen Loh
(Princeton University) Avoiding Small Subgraphs in Achlioptas Processes | Résumé |
Le vendredi 8 mai 2009 |
||||||||
|
|
||||||||
|
08:30 - 09:00
|
Café croissants
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
09:00 - 09:50
|
Kevin Ford
(University of Illinois at Urbana-Champaign) Pratt Trees and a Random Fragmentation | Résumé |
|
09:50 - 10:30
|
Pause-café
|
Salle 6245
|
|
10:30 - 11:20
|
Johan Wästlund
(Chalmers University of Technology) Correlation Decay in Games and Optimization | Résumé |
|
11:30 - 12:20
|
Nikolaos Fountoulakis
(Max-Planck-Institut für Informatik) Broadcasting Problems in Graphs | Résumé |
|
12:20 - 14:00
|
Pause-déjeuner
|
Salle 6245
|
|
Salle de réunion : 6214 |
|
14:00 - 14:50
|
Gábor Lugosi
(ICREA and Pompeu Fabra University) The Longest Minimum-weight Path in a Complete Graph | Résumé |
|
14:50 - 15:30
|
Pause-café
|
Salle 6245
|
|
15:30 - 16:20
|
Lea Popovic
(Concordia University) Scaling Limits for Random Trees in a Random Environment | Résumé |
|
16:30 - 17:20
|
À venir
|
|
Mise à jour: Le lundi 4 mai 2009 11:02