![]() |
![]() |
Reading Group in Combinatorics and Probability
Add to your list(s)
Send you e-mail reminders
Further detail
In Spring 2019 we will be covering selected topics from `The Probabilisitic Method’, by Alon and Spencer. We will meeting on Mondays at 4pm in Lecture Theatre C. We will cover the following topics: Dependent Random Choice, Janson’s inequality, Clique number of random graphs, Chromatic number of random graphs, Rödl Nibble, Independence number of triangle-free graphs, Quasirandom graphs, Containers and list colouring. 0 upcoming talks and 39 talks in the archive. Probabilistic existence of expander graphs
Dynamic programming using a tree decomposition
Tree-decompositions and forbidden Minors
Markov chains and electrical networks: applications
Markov chains and electrical networks: fundamental correspondence
Lower bounds: bottlenecksNote: Reading group starts at 13 instead of 14
Upper bounds III: the method of canonical paths
Upper bounds II: transportation metric, path couplings
The notion of the mixing time. Upper bounds using the coupling method
Total variation distance, couplings, the convergence theorem
Fundamental notions of the theory of Markov chain - examples
If you have a question about this list, please contact: Guillem Perarnau; n.fountoulakis; Henning Sulzbach; Felix Joos; Stefan Glock; R.H.Montgomery. If you have a question about a specific talk, click on that talk to find its organiser. |
Other listsCentre for Computational Biology Seminar Series Computer Security Seminars Medical Imaging Research SeminarsOther talksThe Heat content of polygonal domains Quantum-Enhanced Interferometry hunting in the Dark Universe: How Gravitatioanl-wave detector technology can be (ab)used for other mysteries in fundamental physics. Kneser Graphs are Hamiltonian Tilings, tessellations, and quantum codes TBA Developing coherent light sources from van der Waals heterostructures coupled to plasmonic lattices |