3 papers
math.ST2024
Finding Super-spreaders in Network Cascades
Elchanan Mossel, Anirudh Sridhar
Suppose that a cascade (e.g., an epidemic) spreads on an unknown graph, and only the infection times of vertices are observed. What can be learned about the graph from the infectio…
math.ST2023
Quickest Inference of Susceptible-Infected Cascades in Sparse Networks
Anirudh Sridhar, Tirza Routtenberg, H. Vincent Poor
We consider the task of estimating a network cascade as fast as possible. The cascade is assumed to spread according to a general Susceptible-Infected process with heterogeneous tr…
math.ST2023
Matching Correlated Inhomogeneous Random Graphs using the -core Estimator
Miklós Z. Rácz, Anirudh Sridhar
We consider the task of estimating the latent vertex correspondence between two edge-correlated random graphs with generic, inhomogeneous structure. We study the so-called \emph{$k…