A framework for imperfectly observed 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
Model a network as an edgeweighted graph, where the (unknown) weight $w_e$ of edge $e$ indicates the frequency of observed interactions, that is over time $t$ we observe a Poisson($t w_e$) number of interactions across edges $e$. How should we estimate some given statistic of the underlying network? This leads to wideranging and challenging problems.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
