Heilbronn Workshop on Large Evolving Networks

19th March 2013

Held at Engineers' House, Bristol. Organized jointly with the Applied Probability section of the Royal Statistical Society.

Download the programme and book of abstracts.

Heilbronn administrator: Alice Adams.

Organizers: Niall Adams, James Cruise, Dan Lawson, David Leslie, and Andrew Wade.

Programme

Click on the speaker's name for slides of the talk.

9:00–9:45

Sign-in

9:45–10:00

Opening

10.00–11.00

Colin Cooper (King's College London)

Component structure of the vacant set induced by a random walk on a random graph

11:00–12:00

Nicholas Heard (Imperial College London)

Bayesian methods for monitoring a device within a large dynamic graph

12:00–13:00

Lunch

13:00–14:00

Gesine Reinert (University of Oxford)

Gossip processes and small-world networks

14:00–15:00

Des Higham (University of Strathclyde)

Twitter's big hitters

15:00–15:30

Tea and Coffee break

15:30–16:30

Charles Bordenave (CNRS and University of Toulouse)

Predator-prey dynamics on infinite trees

16:30–17:30

Moez Draief (Imperial College London)

Majority consensus: algorithms and spectral optimisation