Rumors in a Network: Who's the Culprit?

From MaRDI portal
Revision as of 20:40, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5273480

DOI10.1109/TIT.2011.2158885zbMath1366.91126arXiv0909.4370OpenAlexW2111772797MaRDI QIDQ5273480

Tauhid Zaman, Devavrat Shah

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.4370




Related Items (48)

The analysis of an SEIR rumor propagation model on heterogeneous networkClassical and Quantum Random-Walk Centrality Measures in Multilayer NetworksCorrelated randomly growing graphsEnhancing Maximum Likelihood Estimation of Infection Source LocalizationFinding the seed of uniform attachment treesOn the robustness of the metric dimension of grid graphs to adding a single edgeBudgeted sensor placement for source localization on treesTowards Identifying and Predicting Spatial Epidemics on Complex Meta-population NetworksMultiple propagation paths enhance locating the source of diffusion in complex networksAdaptive Test Allocation for Outbreak Detection and Tracking in Social Contact NetworksA microscopic-view infection model based on linear systemsRoot finding algorithms and persistence of Jordan centrality in growing random treesToward Robust Monitoring of Malicious OutbreaksComplexity of Inferring Local Transition Functions of Discrete Dynamical SystemsRoot estimation in Galton–Watson treesGetting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its ApplicationsUncertainty in Study of Social Networks: Robust Optimization and Machine LearningNegative influence blocking maximization with uncertain sources under the independent cascade modelApproximation for the minimum cost doubly resolving set problemFair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence SamplingDegree centrality and root finding in growing random networksContagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network AlgorithmsRumor model on homogeneous social network incorporating delay in expert intervention and government actionSpatial-temporal deep learning model based rumor source identification in social networksImproved degree search algorithms in unstructured P2P networksFinding Adam in random growing treesContrasting the Spread of Misinformation in Online Social NetworksThe patient-zero problem with noisy observationsAn algorithm for locating propagation source in complex networksAre there needles in a moving haystack? Adaptive sensing for detection of dynamically evolving signalsLocating the contagion source in networks with partial timestampsBayesian inference of spreading processes on networksA novel approach for detecting multiple rumor sources in networks with partial observationsThe critical node detection problem in networks: a surveyDynamic 8-state ICSAR rumor propagation model considering official rumor refutationGeneral rumor blocking: an efficient random algorithm with martingale approachMetric dimension of critical Galton-Watson trees and linear preferential attachment treesPersistence of hubs in growing random networksFixation probabilities for simple digraphsDetecting a botnet in a networkAlgorithmic aspect on the minimum (weighted) doubly resolving set problem of graphsPermutation Tests for Infection GraphsSchemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of researchSequential metric dimension for random graphsMinimal contagious sets in random regular graphsBroadcasting on random recursive treesInferring local transition functions of discrete dynamical systems from observations of system behaviorThe power of adaptivity in source identification with time queries on the path






This page was built for publication: Rumors in a Network: Who's the Culprit?