Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learning of networked spreading models from noisy and incomplete data (2401.00011v1)

Published 20 Dec 2023 in cs.SI and cs.LG

Abstract: Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, we introduce a universal learning method based on scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (60)
  1. Mark Newman. Networks. Oxford university press, 2018.
  2. Dynamical processes on complex networks. Cambridge university press, 2008.
  3. Learning the graph of epidemic cascades. ACM SIGMETRICS Performance Evaluation Review, 40(1):211–222, 2012.
  4. Inferring networks of diffusion and influence. ACM Transactions on Knowledge Discovery from Data (TKDD), 5(4):1–37, 2012.
  5. Trace complexity of network inference. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 491–499, 2013.
  6. Inferring graphs from cascades: A sparse recovery framework. In International Conference on Machine Learning, pages 977–986. PMLR, 2015.
  7. Andrey Y Lokhov. Reconstructing parameters of spreading models from partial observations. Advances in Neural Information Processing Systems, 29, 2016.
  8. Prediction-centric learning of independent cascade dynamics from partial observations. In International Conference on Machine Learning, pages 11182–11192. PMLR, 2021.
  9. The cavity approach to parallel dynamics of ising spins on a graph. Journal of Statistical Mechanics: Theory and Experiment, 2009(08):P08009, 2009.
  10. Message passing approach for general epidemic models. Physical Review E, 82(1):016101, 2010.
  11. Majority dynamics on trees and the dynamic cavity method. 2011.
  12. Three lemmas on dynamic cavity method. Communications in Theoretical Physics, 56(1):157, 2011.
  13. Dynamic mean-field and cavity methods for diluted ising systems. Physical Review E, 85(3):031119, 2012.
  14. Large deviations of cascade processes on graphs. Physical Review E, 87(6):062115, 2013.
  15. Optimizing spread dynamics on graphs by message passing. Journal of Statistical Mechanics: Theory and Experiment, 2013(09):P09011, 2013.
  16. Inferring the origin of an epidemic with a dynamic message-passing algorithm. Physical Review E, 90(1):012801, 2014.
  17. Dynamic message-passing equations for models with unidirectional dynamics. Physical Review E, 91(1):012811, 2015.
  18. Dynamic message-passing approach for kinetic spin models with reversible dynamics. Physical Review E, 92(1):010102, 2015.
  19. Message-passing approach for recurrent-state epidemic models on networks. Physical Review E, 92(2):022821, 2015.
  20. Optimal deployment of resources for maximizing impact in spreading processes. Proceedings of the National Academy of Sciences, 114(39):E8138–E8146, 2017.
  21. Scalable influence estimation without sampling. arXiv preprint arXiv:1912.12749, 2019.
  22. Thomas Barthel. The matrix product approximation for the dynamic cavity method. Journal of Statistical Mechanics: Theory and Experiment, 2020(1):013217, 2020.
  23. Competition, collaboration, and optimization in multiple interacting spreading processes. Physical Review X, 11(1):011048, 2021.
  24. Bo Li and David Saad. Impact of presymptomatic transmission on epidemic spreading in contact networks: A dynamic message-passing analysis. Physical Review E, 103(5):052303, 2021.
  25. A closure for the master equation starting from the dynamic cavity method. Journal of Physics A: Mathematical and Theoretical, 56(17):17LT02, 2023.
  26. Matrix product belief propagation for reweighted stochastic dynamics over graphs. Proceedings of the National Academy of Sciences, 120(47):e2307935120, 2023.
  27. Backtracking dynamical cavity method. Phys. Rev. X, 13:031021, Aug 2023.
  28. Bayes-optimal inference for spreading processes on random networks. arXiv preprint arXiv:2303.17704, 2023.
  29. Understanding belief propagation and its generalizations. Exploring artificial intelligence in the new millennium, 8(236-239):0018–9448, 2003.
  30. Information, physics, and computation. Oxford University Press, 2009.
  31. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters, 12(3):211–223, 2001.
  32. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146, 2003.
  33. A contribution to the mathematical theory of epidemics. Proceedings of the royal society of london. Series A, Containing papers of a mathematical and physical character, 115(772):700–721, 1927.
  34. Networks and epidemic models. Journal of the royal society interface, 2(4):295–307, 2005.
  35. Reconstructing diffusion networks from incomplete data. In IJCAI, volume 2022, pages 3085–3091, 2022.
  36. Epidemic modelling: an introduction. Number 15. Cambridge University Press, 2001.
  37. Convex risk minimization to infer networks from probabilistic diffusion data at multiple scales. In 2015 IEEE 31st International Conference on Data Engineering, pages 663–674. IEEE, 2015.
  38. Bayesian inference of spreading processes on networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 474(2215):20180129, 2018.
  39. Learning from contagion (without timestamps). In International Conference on Machine Learning, pages 1845–1853. PMLR, 2014.
  40. Learning network structures from contagion. Information Processing Letters, 121:11–16, 2017.
  41. Network reconstruction from infection cascades. Journal of the Royal Society Interface, 16(151):20180844, 2019.
  42. Statistical estimation of diffusion network topologies. In 2020 IEEE 36th International Conference on Data Engineering (ICDE), pages 625–636. IEEE, 2020.
  43. Learning graphs from noisy epidemic cascades. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3(2):1–34, 2019.
  44. Learning hawkes processes under synchronization noise. In International Conference on Machine Learning, pages 6325–6334. PMLR, 2019.
  45. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1029–1038, 2010.
  46. Finding the probability of infection in an sir network is np-hard. Mathematical biosciences, 240(2):77–84, 2012.
  47. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 199–208, 2009.
  48. Scalable influence estimation in continuous-time diffusion networks. Advances in neural information processing systems, 26, 2013.
  49. Sketch-based influence maximization and computation: Scaling up with guarantees. In Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pages 629–638, 2014.
  50. Influence at scale: Distributed computation of complex contagion in networks. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 735–744, 2015.
  51. Outward influence and cascade size estimation in billion-scale networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(1):1–30, 2017.
  52. Béla Bollobás. Random graphs. In Modern graph theory, pages 215–252. Springer, 1998.
  53. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
  54. Tom Fawcett. An introduction to roc analysis. Pattern recognition letters, 27(8):861–874, 2006.
  55. Mark EJ Newman. The structure and function of complex networks. SIAM review, 45(2):167–256, 2003.
  56. Wayne W Zachary. An information flow model for conflict and fission in small groups. Journal of anthropological research, 33(4):452–473, 1977.
  57. The network data repository with interactive graph analytics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.
  58. Social structure of Facebook networks. Phys. A, 391(16):4165–4180, Aug 2012.
  59. https://github.com/mateuszwilinski/dynamic-message-passing/, 2021.
  60. Stefan Karpinski Jeff Bezanson. The julia programming language.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com