Evidence map›Paper›PMID 37628148›Full record

ArticleEntropy (Basel, Switzerland)2023

Network Analytics Enabled by Generating a Pool of Network Variants from Noisy Data.

Aamir Mandviwalla, Amr Elsisy, Muhammad Saad Atique, Konstantin Kuzmin, Chris Gaiteri, Boleslaw K Szymanski

Open access · goldAbstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
0.2field-weighted citation impact, top 56% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed, 1 citations in OpenAlex.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 2 institutions in 1 country.

Aamir MandviwallaDepartment of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.
Amr ElsisyDepartment of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.ORCID 0000-0001-8758-0121
Muhammad Saad AtiqueDepartment of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.
Konstantin KuzminDepartment of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.
Chris GaiteriRush Alzheimer's Disease Center, Rush University Medical Center, Chicago, IL 60612, USA.
Boleslaw K SzymanskiDepartment of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180, USA.ORCID 0000-0002-0307-6743
Rensselaer Polytechnic Institute · USRush University Medical Center · US

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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's 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.

Indexed as

Bernoulli weighted random network generatorcovert networksfunctional and structural uncertaintynoisy data

Identifiers

PMID37628148
PMCPMC10453411
OpenAlexW4385361721

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.