Fighting false information from propagation process: A survey

L Sun, Y Rao, L Wu, X Zhang, Y Lan, A Nazir - ACM Computing Surveys, 2023 - dl.acm.org
The recent serious cases of spreading false information have posed a significant threat to
the social stability and even national security, urgently requiring all circles to respond …

Using spectral characterization to identify healthcare-associated infection (HAI) patients for clinical contact precaution

J Cui, S Cho, M Kamruzzaman, M Bielskas… - Scientific Reports, 2023 - nature.com
Healthcare-associated infections (HAIs) are a major problem in hospital infection control.
Although HAIs can be suppressed using contact precautions, such precautions are …

Minimizing the influence of misinformation via vertex blocking

J Xie, F Zhang, K Wang, X Lin… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
Information cascade in online social networks can be rather negative, eg, the spread of
rumors may trigger panic. To limit the influence of misinformation in an effective and efficient …

Fairness of information flow in social networks

ZS Jalali, Q Chen, SM Srikanta, W Wang… - ACM Transactions on …, 2023 - dl.acm.org
Social networks form a major parts of people's lives, and individuals often make important
life decisions based on information that spreads through these networks. For this reason, it is …

XFlow: Benchmarking Flow Behaviors over Graphs

Z Zhang, Z Zhang, Z Chen - arXiv preprint arXiv:2308.03819, 2023 - arxiv.org
The occurrence of diffusion on a graph is a prevalent and significant phenomenon, as
evidenced by the spread of rumors, influenza-like viruses, smart grid failures, and similar …

Optimal intervention on weighted networks via edge centrality

D Li, T Eliassi-Rad, HR Zhang - Proceedings of the 2023 SIAM International …, 2023 - SIAM
Suppose there is a spreading process propagating on a weighted graph. Denote the graph's
weight matrix as W. How would we reduce the number of nodes affected during the …

Attacking shortest paths by cutting edges

BA Miller, Z Shafi, W Ruml, Y Vorobeychik… - ACM Transactions on …, 2023 - dl.acm.org
Identifying shortest paths between nodes in a network is a common graph analysis problem
that is important for many applications involving routing of resources. An adversary that can …

[HTML][HTML] Branching processes reveal influential nodes in social networks

P De Meo, M Levene, A Provetti - Information Sciences, 2023 - Elsevier
Branching processes are discrete-time stochastic processes which have been largely
employed to model and simulate information diffusion processes over large online social …

Rewiring police officer training networks to reduce forecasted use of force

R Pandey, J Carter, J Hill, G Mohler - Proceedings of the 29th ACM …, 2023 - dl.acm.org
Research has shown that police officer involved shootings, misconduct and excessive use of
force complaints exhibit network effects, where officers are at greater risk of being involved …

Measures and optimization for robustness and vulnerability in disconnected networks

L Zhu, Q Bao, Z Zhang - IEEE Transactions on Information …, 2023 - ieeexplore.ieee.org
The function or performance of a network is strongly dependent on its robustness, which
quantifies the ability of the network to continue functioning under perturbations. While a wide …