{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:29:57Z","timestamp":1763706597014,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"U.S. Department of Homeland Security","award":["2017-ST061-CINA01","HR001121C0165"],"award-info":[{"award-number":["2017-ST061-CINA01","HR001121C0165"]}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["2017-ST061-CINA01","HR001121C0165"],"award-info":[{"award-number":["2017-ST061-CINA01","HR001121C0165"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Mapping network nodes and edges to communities and network functions is crucial to gaining a higher level of understanding of the network structure and functions. Such mappings are particularly challenging to design for covert social networks, which intentionally hide their structure and functions to protect important members from attacks or arrests. Here, we focus on correctly inferring the structures and functions of such networks, but our methodology can be broadly applied. Without the ground truth, knowledge about the allocation of nodes to communities and network functions, no single network based on the noisy data can represent all plausible communities and functions of the true underlying network. To address this limitation, we apply a generative model that randomly distorts the original network based on the noisy data, generating a pool of statistically equivalent networks. Each unique generated network is recorded, while each duplicate of the already recorded network just increases the repetition count of that network. We treat each such network as a variant of the ground truth with the probability of arising in the real world approximated by the ratio of the count of this network\u2019s duplicates plus one to the total number of all generated networks. Communities of variants with frequently occurring duplicates contain persistent patterns shared by their structures. Using Shannon entropy, we can find a variant that minimizes the uncertainty for operations planned on the network. Repeatedly generating new pools of networks from the best network of the previous step for several steps lowers the entropy of the best new variant. If the entropy is too high, the network operators can identify nodes, the monitoring of which can achieve the most significant reduction in entropy. Finally, we also present a heuristic for constructing a new variant, which is not randomly generated but has the lowest expected cost of operating on the distorted mappings of network nodes to communities and functions caused by noisy data.<\/jats:p>","DOI":"10.3390\/e25081118","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T01:27:46Z","timestamp":1690421266000},"page":"1118","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Network Analytics Enabled by Generating a Pool of Network Variants from Noisy Data"],"prefix":"10.3390","volume":"25","author":[{"given":"Aamir","family":"Mandviwalla","sequence":"first","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"},{"name":"Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8758-0121","authenticated-orcid":false,"given":"Amr","family":"Elsisy","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"},{"name":"Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"}]},{"given":"Muhammad Saad","family":"Atique","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"},{"name":"Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"}]},{"given":"Konstantin","family":"Kuzmin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"},{"name":"Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"}]},{"given":"Chris","family":"Gaiteri","sequence":"additional","affiliation":[{"name":"Rush Alzheimer\u2019s Disease Center, Rush University Medical Center, Chicago, IL 60612, USA"},{"name":"Department of Psychiatry, SUNY Upstate Medical University, Syracuse, NY 13210, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0307-6743","authenticated-orcid":false,"given":"Boleslaw K.","family":"Szymanski","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"},{"name":"Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"ref_1","unstructured":"Statista (2023, June 11). Worldwide Data Created. Available online: http:\/\/www.statista.com\/statistics\/871513\/worldwide-data-created\/.htm."},{"key":"ref_2","unstructured":"Polo, S.M., and Welsh, B. (2022). Oxford Research Encyclopedia of International Studies, Oxford University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1126\/science.1087361","article-title":"A Bayesian networks approach for predicting protein-protein interactions from genomic data","volume":"302","author":"Jansen","year":"2003","journal-title":"Science"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bahulkar, A., Szymanski, B.K., Baycik, N.O., and Sharkey, T.C. (2018, January 28\u201331). Community detection with edge augmentation in criminal networks. Proceedings of the 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Barcelona, Spain.","DOI":"10.1109\/ASONAM.2018.8508326"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.socnet.2016.08.003","article-title":"Communities in criminal networks: A case study","volume":"48","author":"Calderoni","year":"2017","journal-title":"Soc. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cavallaro, L., Ficara, A., De Meo, P., Fiumara, G., Catanese, S., Bagdasar, O., Song, W., and Liotta, A. (2020). Disrupting resilient criminal networks through data analysis: The case of Sicilian Mafia. PLoS ONE, 15.","DOI":"10.1371\/journal.pone.0236476"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12033-007-0069-2","article-title":"Computational prediction of protein\u2013protein interactions","volume":"38","author":"Skrabanek","year":"2008","journal-title":"Mol. Biotechnol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2730","DOI":"10.1093\/bioinformatics\/bti398","article-title":"Correlation between gene expression profiles and protein\u2013protein interactions within and across genomes","volume":"21","author":"Bhardwaj","year":"2005","journal-title":"Bioinformatics"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/net.22084","article-title":"Optimizing edge sets innetworks to produce ground truth communities based on modularity","volume":"80","author":"Kosmas","year":"2022","journal-title":"Networks"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.physa.2018.05.067","article-title":"Toward uncertainty of weighted networks: An entropy-based model","volume":"508","author":"Yin","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"106782","DOI":"10.1016\/j.ress.2019.106782","article-title":"The vulnerability of communities in complex networks: An entropy approach","volume":"196","author":"Wen","year":"2020","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/j.physa.2017.09.042","article-title":"Measure the structure similarity of nodes in complex networks based on relative entropy","volume":"491","author":"Zhang","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"15697","DOI":"10.1038\/s41598-018-32571-3","article-title":"Entropy measures of human communication dynamics","volume":"8","author":"Kulisiewicz","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/1514888.1514891","article-title":"Analyzing communities and their evolutions in dynamic social networks","volume":"3","author":"Lin","year":"2009","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Coscia, M., and Neffke, F.M. (2017, January 19\u201322). Network backboning with noisy data. Proceedings of the 2017 IEEE 33rd International Conference on Data Engineering (ICDE), San Diego, CA, USA.","DOI":"10.1109\/ICDE.2017.100"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ins.2021.10.066","article-title":"A network generator for covert network structures","volume":"584","author":"Elsisy","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1126\/science.1177170","article-title":"Limits of predictability in human mobility","volume":"327","author":"Song","year":"2010","journal-title":"Science"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: First steps","volume":"5","author":"Holland","year":"1983","journal-title":"Soc. Netw."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"056104","DOI":"10.1103\/PhysRevE.67.056104","article-title":"Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations","volume":"67","author":"Vazquez","year":"2022","journal-title":"Phys. Rev. E"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s41109-019-0238-9","article-title":"On community structure in complex networks: Challenges and opportunities","volume":"4","author":"Cherifi","year":"2019","journal-title":"Appl. Netw. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","article-title":"The distribution of the flora in the alpine zone","volume":"11","author":"Jaccard","year":"1912","journal-title":"New Phytol."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Morselli, C. (2009). Inside Criminal Networks, Springer.","DOI":"10.1007\/978-0-387-09526-4"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Everton, S.F. (2012). Disrupting Dark Networks, Cambridge University Press. Structural Analysis in the Social Sciences.","DOI":"10.1017\/CBO9781139136877"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1119\/1.1937609","article-title":"Transmission of Information: A Statistical Theory of Communications","volume":"29","author":"Fano","year":"1961","journal-title":"Am. J. Phys."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/8\/1118\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:19:22Z","timestamp":1760127562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/8\/1118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":27,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["e25081118"],"URL":"https:\/\/doi.org\/10.3390\/e25081118","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,7,26]]}}}