Free Delivery Over $100
|
|
|||
|
||||
OverviewThe rapid spread of infectious diseases and online rumors share similarities in terms of their speed, scale, and patterns of contagion. Although these two phenomena have historically been studied separately, the COVID-19 pandemic has highlighted the devastating consequences that simultaneous crises of epidemics and misinformation can have on the world. Soon after the outbreak of COVID-19, the World Health Organization launched a campaign against the COVID-19 Infodemic, which refers to the dissemination of pandemic-related false information online that causes widespread panic and hinders recovery efforts. Undoubtedly, nothing spreads faster than fear. Networks serve as a crucial platform for viral spreading, as the actions of highly influential users can quickly render others susceptible to the same. The potential for contagion in epidemics and rumors hinges on the initial source, underscoring the need for rapid and efficient digital contact tracing algorithms to identify super-spreaders or Patient Zero. Similarly, detecting and removing rumour mongers is essential for preventing the proliferation of harmful information in online social networks. Identifying the source of large-scale contagions requires solving complex optimization problems on expansive graphs. Accurate source identification and understanding the dynamic spreading process requires a comprehensive understanding of surveillance in massive networks, including topological structures and spreading veracity. Ultimately, the efficacy of algorithms for digital contact tracing and rumour source detection relies on this understanding. This monograph provides an overview of the mathematical theories and computational algorithm design for contagion source detection in large networks. By leveraging network centrality as a tool for statistical inference, we can accurately identify the source of contagions, trace their spread, and predict future trajectories. This approach provides fundamental insights into surveillance capability and asymptotic behaviour of contagion spreading in networks. Mathematical theory and computational algorithms are vital to understanding contagion dynamics, improving surveillance capabilities, and developing effective strategies to prevent the spread of infectious diseases and misinformation. Full Product DetailsAuthor: Chee Wei Tan , Pei-Duo YuPublisher: now publishers Inc Imprint: now publishers Inc Weight: 0.235kg ISBN: 9781638282501ISBN 10: 1638282501 Pages: 160 Publication Date: 04 July 2023 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1. Introduction 2. Preliminaries and Network Centrality 3. Contagion Source Problem and Degree-regular Tree Case 4. Estimation and Detection in Graphs with Irregularities 5. Asymptotic Analysis and Pólya Urn Models 6. Applications to COVID-19 Pandemic and Infodemics 7. Further Discussions and Open Issues Acknowledgements ReferencesReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
