BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Inference and optimal design for percolation and random graph mode
 ls - Andrei Bejan (University of Cambridge)
DTSTART:20090217T143000Z
DTEND:20090217T153000Z
UID:TALK16810@talks.cam.ac.uk
CONTACT:Pedro Brandao
DESCRIPTION:*Slides "available":http://www.cl.cam.ac.uk/research/srg/opera
 /meetings/attachments/2009-02-17-InferenceExpDesign_Bejan.pdf .*\n\nAnimat
 ion Videos are also "available":http://www.cl.cam.ac.uk/~aib29/Talks/OPERA
 _Cambridge_2009/AVI/ .\n\n*Abstract:*\n\nMany real-world phenomena can be 
 modelled by random graphs\, or more generally\, by dynamically changing ra
 ndom graphs. Specifically\, host-pathogen biological systems that may comb
 ine primary and nearest-neighbour or long-range secondary infection proces
 ses can be efficiently described by spatio-temporal models based on random
  graphs evolving in time. Although a continuous observation of an epidemic
  is not always possible\, a spatial `snapshot' may provide one with some\,
  albeit highly incomplete\, knowledge about the epidemic. In terms of the 
 model this knowledge results in a random graph realised in some metric spa
 ce. Moreover\, under some circumstances it is not even possible to observe
  some or all of the edges of such a random graph – all one would know th
 en are the vertices which correspond to the infected sites\, i.e. to those
  sites which interacted as a result of the evolution of the process under 
 consideration.\n\nIn this talk the problems of statistical inference and o
 ptimal design for percolation and random graph models posed within a Bayes
 ian framework will be discussed. This is a joint work with Gavin Gibson an
 d Stan Zachary\, both at Heriot-Watt University\, Edinburgh.\n\n*Bio:*\n\n
 Andrei Bejan is a Research Associate at the Computer Laboratory\, Universi
 ty of Cambridge. His principal research interests lie in the field of stoc
 hastic modelling and statistical inference. His PhD thesis dealt with opti
 mal design problems for percolation and random graph models. His other res
 earch interests include the theory of priority queueing systems with switc
 hover times\, spectral theory of random matrices and development of advanc
 ed numerical methods in these areas. Andrei has recently joined the Comput
 er Laboratory to take part in the project TIME\, where he is working on st
 atistical modelling and analysis of transport traffic data.\n
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR