UC Berkeley

Model a network as an edge-weighted graph, where the (unknown) weight we of edge e indicates the frequency of observed interactions, and over time t we observe a Poisson (twe) number of interactions across edges e. How should we estimate some given statistic of the underlying network? This leads to wide-ranging and challenging problems, on which this article makes only partial progress.