Learning Mixtures of Graphs from Epidemic Cascades
arXiv:1906.06057
Abstract
We consider the problem of learning the weighted edges of a balanced mixture of two undirected graphs from epidemic cascades. While mixture models are popular modeling tools, algorithmic development with rigorous guarantees has lagged. Graph mixtures are apparently no exception: until now, very little is known about whether this problem is solvable. To the best of our knowledge, we establish the first necessary and sufficient conditions for this problem to be solvable in polynomial time on edge-separated graphs. When the conditions are met, i.e., when the graphs are connected with at least three edges, we give an efficient algorithm for learning the weights of both graphs with optimal sample complexity (up to log factors). We give complimentary results and provide sample-optimal (up to log factors) algorithms for mixtures of directed graphs of out-degree at least three, for mixture of undirected graphs of unbalanced and/or unknown priors.
arXiv comment29 pages
References in corpus (10)
- Detection of an anomalous cluster in a network
- Fake News Mitigation via Point Process Based Intervention
- Alternating Minimization for Mixed Linear Regression
- Global analysis of Expectation Maximization for mixtures of two Gaussians
- Solving a Mixture of Many Random Linear Equations by Tensor Decomposition and Alternating Minimization
- EM Converges for a Mixture of Many Linear Regressions
- Meta Learning with Relational Information for Short Sequences
- A lower bound on the performance of dynamic curing policies for epidemics on graphs
- An efficient curing policy for epidemics on graphs
- Who and When to Screen: Multi-Round Active Screening for Recurrent Infectious Diseases Under Uncertainty