Network-based Control of Epidemic via Flattening the Infection Curve: High-Clustered vs. Low-Clustered Social Networks

• URL: http://arxiv.org/abs/2303.09173v1
• Date: Thu, 16 Mar 2023 09:37:21 GMT
• Title: Network-based Control of Epidemic via Flattening the Infection Curve: High-Clustered vs. Low-Clustered Social Networks
• Authors: Mohammadreza Doostmohammadian, Hamid R. Rabiee
• Abstract summary: Clustered networks are, in general, easier to flatten the infection curve. Distance-based centrality measures are better choices for targeting individuals for isolation/vaccination.
• Score: 5.768625063623631
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent studies in network science and control have shown a meaningful relationship between the epidemic processes (e.g., COVID-19 spread) and some network properties. This paper studies how such network properties, namely clustering coefficient and centrality measures (or node influence metrics), affect the spread of viruses and the growth of epidemics over scale-free networks. The results can be used to target individuals (the nodes in the network) to \textit{flatten the infection curve}. This so-called flattening of the infection curve is to reduce the health service costs and burden to the authorities/governments. Our Monte-Carlo simulation results show that clustered networks are, in general, easier to flatten the infection curve, i.e., with the same connectivity and the same number of isolated individuals they result in more flattened curves. Moreover, distance-based centrality measures, which target the nodes based on their average network distance to other nodes (and not the node degrees), are better choices for targeting individuals for isolation/vaccination.

Related papers

• Identifying Asymptomatic Nodes in Network Epidemics using Graph Neural Networks [0.0]
  This work tackles the problem of identifying asymptomatic individuals considering a classic SI (Susceptible-Infected) network epidemic model.<n>A Graph Neural Network (GNN) model with supervised learning is adopted where a set of node features are built from the network with observed infected nodes.<n>Results indicate that the proposed methodology is robust across different scenarios.
  arXiv  Detail & Related papers  (2025-10-02T21:18:18Z)
• Y-Drop: A Conductance based Dropout for fully connected layers [63.029110722758496]
  We introduce Y-Drop, a regularization method that biases the dropout algorithm towards dropping more important neurons with higher probability. We show that forcing the network to solve the task at hand in the absence of its important units yields a strong regularization effect.
  arXiv  Detail & Related papers  (2024-09-11T15:56:08Z)
• Large-Scale Targeted Cause Discovery via Learning from Simulated Data [66.51307552703685]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations.<n>We train a neural network using supervised learning on simulated data to infer causality.<n> Empirical results demonstrate superior performance in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• Digital Twin-Oriented Complex Networked Systems based on Heterogeneous Node Features and Interaction Rules [13.28255056212425]
  This study proposes an extendable modelling framework for Digital Twin-Oriented Complex Networked Systems. We conduct experiments on simulation-based DT-CNSs that incorporate various features and rules about network growth and different transmissibilities related to an epidemic spread on these networks.
  arXiv  Detail & Related papers  (2023-08-18T01:54:48Z)
• Infectious Probability Analysis on COVID-19 Spreading with Wireless Edge Networks [15.76060571297478]
  In this paper, we aim to investigate the prediction of the infectious probability and propose precautionary measures against COVID-19. Due to the availability of the recorded detention time and the density of individuals within a wireless edge network, we propose a geometry-based method to analyze the infectious probability of individuals. Numerical results show that analytical results well match with simulation results, thereby validating the accuracy of the proposed model.
  arXiv  Detail & Related papers  (2022-10-05T04:26:48Z)
• A Systematic Evaluation of Node Embedding Robustness [77.29026280120277]
  We assess the empirical robustness of node embedding models to random and adversarial poisoning attacks. We compare edge addition, deletion and rewiring strategies computed using network properties as well as node labels. We found that node classification suffers from higher performance degradation as opposed to network reconstruction.
  arXiv  Detail & Related papers  (2022-09-16T17:20:23Z)
• Identifying critical nodes in complex networks by graph representation learning [2.304938062591095]
  Influence is one of the main problems in critical nodes mining. IMGNN is a graph learning framework that takes centralities of nodes in a network as input and the probability that nodes in the optimal initial spreaders as output. IMGNN is more efficient than human-based algorithms in minimizing the size of initial spreaders under the fixed infection scale.
  arXiv  Detail & Related papers  (2022-01-20T03:41:22Z)
• BScNets: Block Simplicial Complex Neural Networks [79.81654213581977]
  Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning. We present Block Simplicial Complex Neural Networks (BScNets) model for link prediction. BScNets outperforms state-of-the-art models by a significant margin while maintaining low costs.
  arXiv  Detail & Related papers  (2021-12-13T17:35:54Z)
• SSSNET: Semi-Supervised Signed Network Clustering [4.895808607591299]
  We introduce a novel probabilistic balanced normalized cut loss for training nodes in a GNN framework for semi-supervised signed network clustering, called SSSNET. The main novelty approach is a new take on the role of social balance theory for signed network embeddings.
  arXiv  Detail & Related papers  (2021-10-13T10:36:37Z)
• Estimating the State of Epidemics Spreading with Graph Neural Networks [41.93923100501976]
  algorithmic solutions can be used to infer the state of the whole population from a limited amount of measures. We analyze the capability of deep neural networks to solve this challenging task.
  arXiv  Detail & Related papers  (2021-05-10T13:54:13Z)
• And/or trade-off in artificial neurons: impact on adversarial robustness [91.3755431537592]
  Presence of sufficient number of OR-like neurons in a network can lead to classification brittleness and increased vulnerability to adversarial attacks. We define AND-like neurons and propose measures to increase their proportion in the network. Experimental results on the MNIST dataset suggest that our approach holds promise as a direction for further exploration.
  arXiv  Detail & Related papers  (2021-02-15T08:19:05Z)
• Critical Phenomena in Complex Networks: from Scale-free to Random Networks [77.34726150561087]
  We study critical phenomena in a class of configuration network models with hidden variables controlling links between pairs of nodes. We find analytical expressions for the average node degree, the expected number of edges, and the Landau and Helmholtz free energies, as a function of the temperature and number of nodes.
  arXiv  Detail & Related papers  (2020-08-05T18:57:38Z)
• ResiliNet: Failure-Resilient Inference in Distributed Neural Networks [56.255913459850674]
  We introduce ResiliNet, a scheme for making inference in distributed neural networks resilient to physical node failures. Failout simulates physical node failure conditions during training using dropout, and is specifically designed to improve the resiliency of distributed neural networks.
  arXiv  Detail & Related papers  (2020-02-18T05:58:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.