Reconstructing Sparse Multiplex Networks with Application to Covert Networks

Abstract

Network structure provides critical information for understanding the dynamic behavior of networks. However, the complete structure of real-world networks is often unavailable, thus it is crucially important to develop approaches to infer a more complete structure of networks. In this paper, we integrate the configuration model for generating random networks into an Expectation-Maximization-Aggregation (EMA) framework to reconstruct the complete structure of multiplex networks. We validate the proposed EMA framework against the random model on several real-world multiplex networks, including both covert and overt ones. It is found that the EMA framework generally achieves the best predictive accuracy compared to the EM framework and the random model. As the number of layers increases, the performance improvement of EMA over EM decreases. The inferred multiplex networks can be leveraged to inform the decision-making on monitoring covert networks as well as allocating limited resources for collecting additional information to improve reconstruction accuracy. For law enforcement agencies, the inferred complete network structure can be used to develop more effective strategies for covert network interdiction.

References in corpus (6)

• Network resilience
• Disrupting Resilient Criminal Networks through Data Analysis: The case of Sicilian Mafia
• Prediction of scientific collaborations through multiplex interaction networks
• Link prediction in multiplex networks via triadic closure
• Multilayer Network Analysis: The Identification of Key Actors in a Sicilian Mafia Operation
• Generating Synthetic Systems of Interdependent Critical Infrastructure Networks