Random Discrete Structures
Random Discrete Structures
Date
May 22, 2017
Registration
–
Location
FME-UPC
Random methods have become one of the most active and fruitful areas of research in many areas of mathematics, science and engineering, most notably in combinatorics and computer science, in an interplay with probability theory. These series of courses will cover a wide spectrum of these interactions, including random graphs, random trees, extremal combinatorics and random geometric graphs.
Date
May 22, 2017
Registration
–
Location
FME-UPC
Random methods have become one of the most active and fruitful areas of research in many areas of mathematics, science and engineering, most notably in combinatorics and computer science, in an interplay with probability theory. These series of courses will cover a wide spectrum of these interactions, including random graphs, random trees, extremal combinatorics and random geometric graphs.
Lecturers
Colin McDiarmid (University of Oxford)
https://www.maths.ox.ac.uk/people/colin.mcdiarmid
Luc Devroye (McGill University)
http://luc.devroye.org/
David Conlon (University of Oxford)
https://www.maths.ox.ac.uk/people/david.conlon
Tobias Muller (Utrecht University)
https://www.staff.science.uu.nl/~muell001/
Schedule
22nd May 2017 to 16th June 2017
week 1: 21st May to 26th (5 hours)
week 2: 29th May to 2nd June (5 hours)
week 4: June 12th to 16th (10 hours)
Details about the precise schedule will appear soon
Contents
The following are the 4 courses. This makes a total of 20-25 hours of graduate courses:
- Discrete Fourier analysis: combinatorics and percolation (Tobias Müller, Week 1)
- Embedding large structures in random graphs(David Conlon, Week 2)
- Random trees: from Darwin to Janson (Luc Devroye, Week 4)
- Random graphs from constrained graph classes (Colin McDiarmid, Week 4)