University of Cambridge > > Isaac Newton Institute Seminar Series > Nonparametrics for networks

Nonparametrics for networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

SNAW01 - Graph limits and statistics

Relational data have become an important component of modern statistics. Networks, and weighted networks, are ubiquitous in modern applications such as disease dynamics, ecology, financial contagion, and neuroscience. The inference of networks is harder, in parts because the measure placed on the observables need to satisfy sets of permutation invariances, and most networks are very sparse, with most possible relations not present.

This talk will explore how to best construct nonparametric summaries of such objects, in such as way that the underlying statistical model of the observations is well described, and any estimators computable with scalable algorithms.

This is joint work with Pierre-Andre Maugis and Patrick Wolfe (UCL).

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity