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 > Signal Processing and Communications Lab Seminars > Bayesian inference for exponential random graphs
Bayesian inference for exponential random graphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Rachel Fogg. This talk has been canceled/deleted The exponential random graph is widely used in the statistical analysis of network data. It is a Markov random field model, and suffers from the problem that the likelihood is unavailable for all but trivially small networks. This talk will present two approaches; one simulation based, the other deterministic, which aim to overcome this difficulty. This talk is part of the Signal Processing and Communications Lab Seminars series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsLatin American Cavendish HEP Seminars University of Cambridge - Politecnico di TorinoOther talksThe Productivity Paradox: are we too busy to get anything done? Identifying new gene regulating networks in immune cells Uncertainty Quantification with Multi-Level and Multi-Index methods The genetics of depression Mathematical applications of little string theory Direct measurements of dynamic granular compaction at the mesoscale using synchrotron X-ray radiography Computing knot Floer homology Dynamical large deviations in glassy systems |