Finding Rumor Sources on Random Trees

DOI10.1287/opre.2015.1455zbMath1348.90166arXiv1110.6230OpenAlexW2289188741MaRDI QIDQ2830756

Tauhid Zaman, Devavrat Shah

Publication date: 31 October 2016

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

networksinformation diffusionrumorssource detection

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items

Correlated randomly growing graphs ⋮ Finding the seed of uniform attachment trees ⋮ Root estimation in Galton–Watson trees ⋮ Rumor identification with maximum entropy in MicroNet ⋮ Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning ⋮ Degree centrality and root finding in growing random networks ⋮ Inference and rare event simulation for stopped Markov processes via reverse-time sequential Monte Carlo ⋮ Diffusion in Random Networks: Impact of Degree Distribution ⋮ Community-based immunization in opportunistic social networks ⋮ Preface to the Special Issue on Information and Decisions in Social and Economic Networks ⋮ Reciprocal spreading and debunking processes of online misinformation: a new rumor spreading-debunking model with a case study ⋮ Schemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of research

Cites Work

• Unnamed Item
• On the conductance of order Markov chains
• Reconstruction on trees: Beating the second eigenvalue
• Broadcasting on trees and the Ising model.
• On finite exponential moments for branching processes and busy periods for queues

This page was built for publication: Finding Rumor Sources on Random Trees