COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Computer Laboratory Opera Group Seminars > Inference and optimal design for percolation and random graph models

## Inference and optimal design for percolation and random graph modelsAdd to your list(s) Download to your calendar using vCal - Andrei Bejan (University of Cambridge)
- Tuesday 17 February 2009, 14:30-15:30
- Room FW11, Computer Laboratory, William Gates Building.
If you have a question about this talk, please contact Pedro Brandao.
Animation Videos are also available .
Many real-world phenomena can be modelled by random graphs, or more generally, by dynamically changing random graphs. Specifically, host-pathogen biological systems that may combine primary and nearest-neighbour or long-range secondary infection processes 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 space. 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 then 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. In this talk the problems of statistical inference and optimal design for percolation and random graph models posed within a Bayesian framework will be discussed. This is a joint work with Gavin Gibson and Stan Zachary, both at Heriot-Watt University, Edinburgh.
Andrei Bejan is a Research Associate at the Computer Laboratory, University of Cambridge. His principal research interests lie in the field of stochastic modelling and statistical inference. His PhD thesis dealt with optimal design problems for percolation and random graph models. His other research interests include the theory of priority queueing systems with switchover times, spectral theory of random matrices and development of advanced numerical methods in these areas. Andrei has recently joined the Computer Laboratory to take part in the project TIME , where he is working on statistical modelling and analysis of transport traffic data. This talk is part of the Computer Laboratory Opera Group Seminars series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Cambridge talks
- Computer Laboratory Opera Group Seminars
- Computer Laboratory talks
- Interested Talks
- Room FW11, Computer Laboratory, William Gates Building
- School of Technology
- Trust & Technology Initiative - interesting events
- bld31
Note that ex-directory lists are not shown. |
## Other listsEarly Detection breakfast meetings Foster Talks Cambridge Conference on Global Food Security 2016## Other talksAdaptation in log-concave density estimation Cancer and Metbolism 2018 Back on the Agenda? Industrial Policy revisited Conference Lua: designing a language to be embeddable Surface meltwater ponding and drainage causes ice-shelf flexure Acceleration of tropical cyclogenesis by self-aggregation feedbacks |