Oxford Events, the new replacement for OxTalks, will launch on 16th March. From now until the launch of Oxford Events, new events cannot be published or edited on OxTalks while all existing records are migrated to the new platform. The existing OxTalks site will remain available to view during this period.
From 16th, Oxford Events will launch on a new website: events.ox.ac.uk, and event submissions will resume. You will need a Halo login to submit events. Full details are available on the Staff Gateway.
We consider large random graphs with a given degree sequence. In the sparse regime where the degree sequence converges to a probability distribution, the model has a phase transition for the existence of a macroscopic connected component. In this talk, we will study the depth first search algorithm in the supercritical regime. In particular, we will see that the evolution of the empirical degree distribution of the unexplored vertices has a fluid limit which is driven by an infinite system of differential equations. Surprisingly, this system admits an explicit solution in terms of the initial degree distribution. This in turn allows to prove that the renormalised contour process of the exploration has a deterministic profile for which we can give an explicit parametric representation. The height of this curve gives information about long simple paths in the graph.
