Combinatorial Theory Seminar (past)
|
Tue, 31/01/2006 15:00 |
Oliver Riordan (Cambridge) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 24/01/2006 15:00 |
Demetres Christofides (Cambridge) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 17/01/2006 15:00 |
Andrea Montanari (LPT-ENS) |
Combinatorial Theory Seminar |
L3 |
|
Fri, 09/12/2005 14:30 |
Katalin Marton (Renyi Institute, Budapest) |
Combinatorial Theory Seminar |
L3 |
| http://www.stats.ox.ac.uk/seminars/05_06%20Seminars/lonabstract.pdf | |||
|
Tue, 06/12/2005 15:00 |
Bruce Reed (McGill) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 29/11/2005 15:00 |
Graham Brightwell (LSE) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 22/11/2005 15:00 |
Imre Leader (Cambridge) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 15/11/2005 15:00 |
Daniela Kuhn (Birmingham) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 08/11/2005 15:00 |
Jan van den Heuvel (LSE) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 01/11/2005 15:00 |
Andrew Thomason (Cambridge) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 25/10/2005 15:00 |
Konrad Swanepoel (Pretoria) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 18/10/2005 15:00 |
Dezso Miklos (Renyi Institute and London) |
Combinatorial Theory Seminar |
L3 |
|
Wed, 05/10/2005 15:00 |
Mihyun Kang (Berlin) |
Combinatorial Theory Seminar |
Dept. of Statistics |
| Recently random planar structures, such as planar graphs and outerplanar graphs, have received much attention. Typical questions one would ask about them are the following: how many of them are there, can we sample a random instance uniformly at random, and what properties does a random planar structure have ? To answer these questions we decompose the planar structures along their connectivity. For the asymptotic enumeration we interpret the decomposition in terms of generating funtions and derive the asymptotic number, using singularity analysis. For the exact enumeration and the uniform generation we use the so-called recursive method: We derive recursive counting formulas along the decomposition, which yields a deterministic polynomial time algorithm to sample a planar structure that is uniformly distributed. In this talk we show how to apply these methods to several labeled planar structures, e.g., planar graphs, cubic planar graphs, and outerplanar graphs. | |||
|
Thu, 23/06/2005 15:00 |
Charles Semple (Canterbury) |
Combinatorial Theory Seminar |
Dept. of Statistics |
|
Tue, 07/06/2005 15:00 |
Joseph Bonin (George Washington University) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 31/05/2005 15:00 |
Jorge Ramirez-Alfonsin (Paris) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 24/05/2005 15:00 |
Robert Leese (Oxford, and Smith Institute) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 10/05/2005 15:00 |
Alan Sokal (NYU/UCL) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 03/05/2005 15:00 |
David Larman (UCL) |
Combinatorial Theory Seminar |
L3 |
|
Tue, 26/04/2005 15:00 |
James Oxley (LSU and Oxford) |
Combinatorial Theory Seminar |
L3 |
