Improving tobacco social contagion models using agent-based simulations on networks

• URL: http://arxiv.org/abs/2207.08254v1
• Date: Sun, 17 Jul 2022 18:40:59 GMT
• Title: Improving tobacco social contagion models using agent-based simulations on networks
• Authors: Adarsh Prabhakaran, Valerio Restocchi and Benjamin D. Goddard
• Abstract summary: We develop an agent-based model (ABM) to study smoking dynamics. We test the ABM on six different networks, both synthetic and real-world. Our results suggest that the dynamics from the ODE model are similar to the ABM only when the network structure is fully connected.
• Score: 0.4511923587827302
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Over the years, population-level tobacco control policies have considerably reduced smoking prevalence worldwide. However, the rate of decline of smoking prevalence is slowing down. Therefore, there is a need for models that capture the full complexity of the smoking epidemic. These models can then be used as test-beds to develop new policies to limit the spread of smoking. Current models of smoking dynamics mainly use ordinary differential equation (ODE) models, where studying the effect of an individual's contact network is challenging. They also do not consider all the interactions between individuals that can lead to changes in smoking behaviour, implying that they do not consider valuable information on the spread of smoking behaviour. In this context, we develop an agent-based model (ABM), calibrate and then validate it on historical trends observed in the US and UK. Our ABM considers spontaneous terms, interactions between agents, and the agent's contact network. To explore the effect of the underlying network on smoking dynamics, we test the ABM on six different networks, both synthetic and real-world. In addition, we also compare the ABM with an ODE model. Our results suggest that the dynamics from the ODE model are similar to the ABM only when the network structure is fully connected (FC). The FC network performs poorly in replicating the empirical trends in the data, while the real-world network best replicates it amongst the six networks. Further, when information on the real-world network is unavailable, our ABM on Lancichinetti-Fortunato-Radicchi benchmark networks (or networks with a similar average degree as the real-world network) can be used to model smoking behaviour. These results suggest that networks are essential for modelling smoking behaviour and that our ABM can be used to develop network-based intervention strategies and policies for tobacco control.

Related papers

• Causal Graph Neural Networks for Wildfire Danger Prediction [25.12733727343395]
  Wildfire forecasting is notoriously hard due to the complex interplay of different factors such as weather conditions, vegetation types and human activities. Deep learning models show promise in dealing with this complexity by learning directly from data. We argue that we need models that are right for the right reasons; that is, the implicit rules learned should be grounded by the underlying processes driving wildfires.
  arXiv  Detail & Related papers  (2024-03-13T10:58:55Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Unsupervised Spiking Neural Network Model of Prefrontal Cortex to study Task Switching with Synaptic deficiency [0.0]
  We build a computational model of Prefrontal Cortex (PFC) using Spiking Neural Networks (SNN) In this study, we use SNN's having parameters close to biologically plausible values and train the model using unsupervised Spike Timing Dependent Plasticity (STDP) learning rule.
  arXiv  Detail & Related papers  (2023-05-23T05:59:54Z)
• A Generic Shared Attention Mechanism for Various Backbone Neural Networks [53.36677373145012]
  Self-attention modules (SAMs) produce strongly correlated attention maps across different layers. Dense-and-Implicit Attention (DIA) shares SAMs across layers and employs a long short-term memory module. Our simple yet effective DIA can consistently enhance various network backbones.
  arXiv  Detail & Related papers  (2022-10-27T13:24:08Z)
• Optimal Connectivity through Network Gradients for the Restricted Boltzmann Machine [0.0]
  A fundamental problem is efficiently finding connectivity patterns that improve the learning curve. Recent approaches explicitly include network connections as parameters that must be optimized in the model. This work presents a method to find optimal connectivity patterns for RBMs based on the idea of network gradients.
  arXiv  Detail & Related papers  (2022-09-14T21:09:58Z)
• Differentiable Agent-based Epidemiology [71.81552021144589]
  We introduce GradABM: a scalable, differentiable design for agent-based modeling that is amenable to gradient-based learning with automatic differentiation. GradABM can quickly simulate million-size populations in few seconds on commodity hardware, integrate with deep neural networks and ingest heterogeneous data sources.
  arXiv  Detail & Related papers  (2022-07-20T07:32:02Z)
• DualCF: Efficient Model Extraction Attack from Counterfactual Explanations [57.46134660974256]
  Cloud service providers have launched Machine-Learning-as-a-Service platforms to allow users to access large-scale cloudbased models via APIs. Such extra information inevitably causes the cloud models to be more vulnerable to extraction attacks. We propose a novel simple yet efficient querying strategy to greatly enhance the querying efficiency to steal a classification model.
  arXiv  Detail & Related papers  (2022-05-13T08:24:43Z)
• Predicting Influential Higher-Order Patterns in Temporal Network Data [2.5782420501870287]
  We propose eight centrality measures based on MOGen, a multi-order generative model that accounts for all paths up to a maximum distance but disregards paths at higher distances. We show that MOGen consistently outperforms both the network model and path-based prediction.
  arXiv  Detail & Related papers  (2021-07-26T10:44:46Z)
• Collective Awareness for Abnormality Detection in Connected Autonomous Vehicles [4.659696262995864]
  This article presents a novel approach to develop an initial level of collective awareness in a network of intelligent agents. A specific collective self awareness functionality is considered, namely, agent centered detection of abnormal situations. The impact is also evaluated by the communication channel used by the network to share the data sensed in a distributed way by each agent of the network.
  arXiv  Detail & Related papers  (2020-10-28T12:11:36Z)
• Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness [97.67477497115163]
  We use mode connectivity to study the adversarial robustness of deep neural networks. Our experiments cover various types of adversarial attacks applied to different network architectures and datasets. Our results suggest that mode connectivity offers a holistic tool and practical means for evaluating and improving adversarial robustness.
  arXiv  Detail & Related papers  (2020-04-30T19:12:50Z)
• Neural Additive Models: Interpretable Machine Learning with Neural Nets [77.66871378302774]
  Deep neural networks (DNNs) are powerful black-box predictors that have achieved impressive performance on a wide variety of tasks. We propose Neural Additive Models (NAMs) which combine some of the expressivity of DNNs with the inherent intelligibility of generalized additive models. NAMs learn a linear combination of neural networks that each attend to a single input feature.
  arXiv  Detail & Related papers  (2020-04-29T01:28:32Z)

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.