An adaptation of InfoMap to absorbing random walks using absorption-scaled graphs

• URL: http://arxiv.org/abs/2112.10953v4
• Date: Tue, 23 Apr 2024 21:04:18 GMT
• Title: An adaptation of InfoMap to absorbing random walks using absorption-scaled graphs
• Authors: Esteban Vargas Bernal, Mason A. Porter, Joseph H. Tien,
• Abstract summary: We adapt InfoMap to absorb random walks with high disease-removal rates. One of our adaptations converges to the standard version of InfoMap in the limit in which the node-absorption rates approach $0$. We also illustrate that the community structure that is induced by heterogeneous absorption rates can have important implications for susceptible-infected-recovered (SIR) dynamics on ring-lattice networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: InfoMap is a popular approach to detect densely connected "communities" of nodes in networks. To detect such communities, InfoMap uses random walks and ideas from information theory. Motivated by the dynamics of disease spread on networks, whose nodes can have heterogeneous disease-removal rates, we adapt InfoMap to absorbing random walks. To do this, we use absorption-scaled graphs (in which edge weights are scaled according to absorption rates) and Markov time sweeping. One of our adaptations of InfoMap converges to the standard version of InfoMap in the limit in which the node-absorption rates approach $0$. We demonstrate that the community structure that one obtains using our adaptations of InfoMap can differ markedly from the community structure that one detects using methods that do not account for node-absorption rates. We also illustrate that the community structure that is induced by heterogeneous absorption rates can have important implications for susceptible-infected-recovered (SIR) dynamics on ring-lattice networks. For example, in some situations, the outbreak duration is maximized when a moderate number of nodes have large node-absorption rates.

Related papers

• Epidemiology-informed Network for Robust Rumor Detection [59.89351792706995]
  We propose a novel Epidemiology-informed Network (EIN) that integrates epidemiological knowledge to enhance performance. To adapt epidemiology theory to rumor detection, it is expected that each users stance toward the source information will be annotated. Our experimental results demonstrate that the proposed EIN not only outperforms state-of-the-art methods on real-world datasets but also exhibits enhanced robustness across varying tree depths.
  arXiv  Detail & Related papers  (2024-11-20T00:43:32Z)
• Diffusion-based Data Augmentation for Object Counting Problems [62.63346162144445]
  We develop a pipeline that utilizes a diffusion model to generate extensive training data. We are the first to generate images conditioned on a location dot map with a diffusion model. Our proposed counting loss for the diffusion model effectively minimizes the discrepancies between the location dot map and the crowd images generated.
  arXiv  Detail & Related papers  (2024-01-25T07:28:22Z)
• SCAAT: Improving Neural Network Interpretability via Saliency Constrained Adaptive Adversarial Training [10.716021768803433]
  Saliency map is a common form of explanation illustrating the heatmap of feature attributions. We propose a model-agnostic learning method called Saliency Constrained Adaptive Adversarial Training (SCAAT) to improve the quality of such DNN interpretability.
  arXiv  Detail & Related papers  (2023-11-09T04:48:38Z)
• On the Two Sides of Redundancy in Graph Neural Networks [6.14580854336436]
  We develop a novel aggregation scheme based on neighborhood trees. We propose compact representations of neighborhood trees and merge them, exploiting computational redundancy. Our method is less susceptible to oversquashing than traditional message passing neural networks.
  arXiv  Detail & Related papers  (2023-10-06T12:09:09Z)
• Efficient Anatomical Labeling of Pulmonary Tree Structures via Deep Point-Graph Representation-based Implicit Fields [45.16492100245491]
  Pulmonary diseases rank prominently among the principal causes of death worldwide. Traditional approaches using high-resolution image stacks and standard CNNs on dense voxel grids face challenges in computational efficiency, limited resolution, local context, and inadequate preservation of shape topology. Our method addresses these issues by shifting from dense voxel to sparse point representation, offering better memory efficiency and global context utilization.
  arXiv  Detail & Related papers  (2023-09-29T15:40:58Z)
• ARISE: Graph Anomaly Detection on Attributed Networks via Substructure Awareness [70.60721571429784]
  We propose a new graph anomaly detection framework on attributed networks via substructure awareness (ARISE) ARISE focuses on the substructures in the graph to discern abnormalities. Experiments show that ARISE greatly improves detection performance compared to state-of-the-art attributed networks anomaly detection (ANAD) algorithms.
  arXiv  Detail & Related papers  (2022-11-28T12:17:40Z)
• 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)
• Topological data analysis of truncated contagion maps [0.0]
  We show that a truncation of the threshold contagions may considerably speed up the construction of contagion maps. We also show that contagion maps may be used to find an insightful low-dimensional embedding for single-cell RNA-sequencing data.
  arXiv  Detail & Related papers  (2022-03-03T14:08:05Z)
• CAMERAS: Enhanced Resolution And Sanity preserving Class Activation Mapping for image saliency [61.40511574314069]
  Backpropagation image saliency aims at explaining model predictions by estimating model-centric importance of individual pixels in the input. We propose CAMERAS, a technique to compute high-fidelity backpropagation saliency maps without requiring any external priors.
  arXiv  Detail & Related papers  (2021-06-20T08:20:56Z)
• AMA-GCN: Adaptive Multi-layer Aggregation Graph Convolutional Network for Disease Prediction [20.19380805655623]
  We propose an encoder that automatically selects the appropriate phenotypic measures according to their spatial distribution. We also propose a novel graph convolution network architecture using multi-layer aggregation mechanism.
  arXiv  Detail & Related papers  (2021-06-16T12:13:23Z)
• Applications of Koopman Mode Analysis to Neural Networks [52.77024349608834]
  We consider the training process of a neural network as a dynamical system acting on the high-dimensional weight space. We show how the Koopman spectrum can be used to determine the number of layers required for the architecture. We also show how using Koopman modes we can selectively prune the network to speed up the training procedure.
  arXiv  Detail & Related papers  (2020-06-21T11:00:04Z)

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.