L3

Consider the Erdos-Renyi random graph $G(n,p)$ inside the critical window, so that $p = n^{-1} + \lambda n^{-4/3}$ for some real \lambda. In

this regime, the largest components are of size $n^{2/3}$ and have finite surpluses (where the surplus of a component is the number of edges more than a tree that it has). Using a bijective correspondence between graphs and certain "marked random walks", we are able to give a (surprisingly simple) metric space description of the scaling limit of the ordered sequence of components, where edges in the original graph are re-scaled by $n^{-1/3}$. A limit component, given its size and surplus, is obtained by taking a continuum random tree (which is not a Brownian continuum random tree, but one whose distribution has been exponentially tilted) and making certain natural vertex identifications, which correspond to the surplus edges. This gives a metric space in which distances are calculated using paths in the original tree and the "shortcuts" induced by the vertex identifications. The limit of the whole critical random graph is then a collection of such

metric spaces. The convergence holds in a sufficiently strong sense (an appropriate version of the Gromov-Hausdorff distance) that we are able to deduce the convergence in distribution of the diameter of $G(n,p)$, re-scaled by $n^{-1/3}$, to a non-degenerate random variable, for $p$ in the critical window.

This is joint work (in progress!) with Louigi Addario-Berry (Universite de Montreal) and Nicolas Broutin (INRIA Rocquencourt).

Random partial orders and random linear extensions

Several interesting models of random partial orders can be described via a

process that builds the partial order one step at a time, at each point

adding a new maximal element. This process therefore generates a linear

extension of the partial order in tandem with the partial order itself. A

natural condition to demand of such processes is that, if we condition on

the occurrence of some finite partial order after a given number of steps,

then each linear extension of that partial order is equally likely. This

condition is called "order-invariance".

The class of order-invariant processes includes processes generating a

random infinite partial order, as well as those that amount to taking a

random linear extension of a fixed infinite poset.

Our goal is to study order-invariant processes in general. In this talk, I

shall explain some of the problems that need to be resolved, and discuss

some of the combinatorial problems that arise.

(joint work with Malwina Luczak)

I will outline the proof of two old conjectures of Cameron Gordon. The first states that the maximal number of exceptional Dehn surgeries on a 1-cusped hyperbolic 3-manifold is 10. The second states the maximal distance between exceptional Dehn surgeries on a 1-cusped hyperbolic 3-manifold is 8. The proof uses a combination of new geometric techniques and rigorous computer-assisted calculations.

This is joint work with Rob Meyerhoff.

The notion of a sutured 3-manifold was introduced by Gabai. It is a powerful tool in 3-dimensional topology. A few years ago, Andras Juhasz defined an invariant of sutured manifolds called sutured Floer homology.

I'll discuss a simpler invariant obtained by taking the Euler characteristic of this theory. This invariant turns out to have many properties in common with the Alexander polynomial. Joint work with Stefan Friedl and Andras Juhasz.