The seventh Mathematics of network meeting will take place on the 27th June 2008 in the Department of Engineering Mathematics, University of Bristol.

This series of free, interdisciplinary meetings allow researchers from different fields to come together and exchange ideas in an informal atmosphere. The seventh meeting's theme is transport networks but there are talks which should be relevant to anyone with an interest in networks research.

Programme

11.00-11.30 - Arrival and coffee

11.30-12.15 - Dynamic modelling of road transport networks Ben Heydecker and J D Addison (University College London)

12.15-1.00 - Design of incentive mechanisms for overlay networks Raul Landa (University College London)

1.00-2.00 - Lunch

2.00-2.45 - Cascades on correlated and modular networks James Gleeson (University of Limerick)

2.45-3.30 - Inference for origin-destination matrices of transport networks: a Bayesian approach Baibing Li (Loughborough University)

3.30-4.00 - Coffee

4.00-4.45 - On the master route problem Vladimir Deineko (University of Warwick)

4.45-5.30 - Hyperstar: A multi-path A* algorithm and its applications in transport Michael Bell (Imperial College)

The meeting is free and if you wish to attend please send an email confirming your attendance to Richard Clegg by 20 June 2008.

Further information

Abstracts for all talk and further information can be found at http://www.richardclegg.org/mon/meeting7.

Source: http://www.richardclegg.org/mon/