Confidence Sets for the Source of a Diffusion in Regular Trees
@article{Khim2017ConfidenceSF,
title={Confidence Sets for the Source of a Diffusion in Regular Trees},
author={Justin Khim and Po-Ling Loh},
journal={IEEE Transactions on Network Science and Engineering},
year={2017},
volume={4},
pages={27-40}
}We study the problem of identifying the source of a diffusion spreading over a regular tree. When the degree of each node is at least three, we show that it is possible to construct confidence sets for the diffusion source with size independent of the number of infected nodes. Our estimators are motivated by analogous results in the literature concerning identification of the root node in preferential attachment and uniform attachment trees. At the core of our proofs is a probabilistic analysis…
41 Citations
Persistence of centrality in random growing trees
- Computer Science, MathematicsRandom Struct. Algorithms
- 2018
It is proved that a single node persists as the tree centroid after a finite number of steps, with probability 1, for random trees grown according to a preferential attachment model, a uniform attachment model), or a diffusion processes over a regular tree.
Persistence of the Jordan Center in Random Growing Trees
- Mathematics2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
- 2018
It is shown that as the infected subgraph grows with time, the Jordan center persists on a single vertex after a finite number of timesteps for the Independent Cascade model and the discrete Susceptible Infected model.
Jordan centre in random trees: persistence and distance to root
- MathematicsJ. Complex Networks
- 2020
This work considers a regular tree graph on which an infection starts from a root node and then spreads along the edges of the graph according to various random spread models and establishes that as the infected subgraph grows with time, the Jordan centre persists on a single vertex after a finite number of timesteps.
Approximate Identification of the Optimal Epidemic Source in Complex Networks
- Computer ScienceProceedings of NetSci-X 2020: Sixth International Winter School and Conference on Network Science
- 2020
This work takes a fully statistical approach and derive novel recursions to compute the Bayes optimal solution, under a susceptible-infected (SI) epidemic model, and provides two tractable algorithms for solving these recursions, a mean-field approximation and a greedy approach, and evaluates their performance on real and synthetic networks.
On the discovery of the seed in uniform attachment trees
- MathematicsInternet Math.
- 2019
We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's properties, and with a…
Rumor Source Detection: A Probabilistic Perspective
- Computer Science2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- 2018
An efficient Belief-Propagation-based (BP) algorithm to compute the joint likelihood function of the source location and the spreading time for the general continuous-time Susceptible-Infected epidemic model on trees and a “Gamma Generated Tree” heuristic to extend the BP algorithm to general graphs.
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree
- Computer Science2019 IEEE International Symposium on Information Theory (ISIT)
- 2019
This paper addresses the rumor source identification problem by focusing on a network represented by a regular tree which does not have any cycle and in which all nodes have the same number of edges connected to a node.
Diffusion Source Identification on Networks with Statistical Confidence
- Computer ScienceICML
- 2021
This work introduces a statistical framework for the study of diffusion source identification and develops a confidence set inference approach inspired by hypothesis testing, which efficiently produces a small subset of nodes that provably covers the source node with any prespecified confidence level without restrictive assumptions on network structures.
Root and community inference on the latent growth process of a network using noisy attachment models
- Computer Science
- 2021
An inference algorithm based on Gibbs sampling that scales to networks with millions of nodes and theoretical analysis showing that the expected size of the confidence set is small so long as the noise level of the ER edges is not too large are provided.
Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process
- MathematicsArXiv
- 2016
It is proved that almost surely, a unique terminal tree centroid emerges, having the property that it becomes more central than any other fixed vertex in the limit of the random growth process.
References
SHOWING 1-10 OF 30 REFERENCES
Rumor centrality: a universal source detector
- MathematicsSIGMETRICS '12
- 2012
A variety of results are obtained establishing the universality of rumor centrality in the context of tree-like graphs and the SI model with a generic spreading time distribution and an interesting connection between a multi-type continuous time branching process and the effectiveness of rumors centrality is made.
Locating the Source of Diffusion in Large-Scale Networks
- Computer SciencePhysical review letters
- 2012
It is shown that it is fundamentally possible to estimate the location of the source of diffusion from measurements collected by sparsely placed observers, and a strategy is presented that is optimal for arbitrary trees, achieving maximum probability of correct localization.
Rumor source detection under probabilistic sampling
- Computer Science2013 IEEE International Symposium on Information Theory
- 2013
This work provides the extension to the case in which nodes reveal whether they have heard the rumor with probability p, independent of each other, and achieves the same performance as the optimal estimator with p = 1.
Source Localization in Networks: Trees and Beyond
- Computer ScienceArXiv
- 2015
Numerical experiments on tree networks, the ER random graphs and real world networks with different evaluation metrics show that the new source localization algorithm, called the Short-Fat Tree (SFT), outperforms existing algorithms.
The Power of Local Information in Social Networks
- Computer ScienceWINE
- 2012
It is concluded that a network provider's decision of how much structure to make visible to its users can have a significant effect on a user's ability to interact strategically with the network.
Rumors in a Network: Who's the Culprit?
- Computer ScienceIEEE Transactions on Information Theory
- 2011
Simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.
A robust information source estimator with sparse observations
- Computer Science, MathematicsIEEE INFOCOM 2014 - IEEE Conference on Computer Communications
- 2014
It is proved that on infinite trees, the sample path based estimator is a Jordan infection center with respect to the set of observed infected nodes and the distance between the estimator and the actual source is upper bounded by a constant independent of the number of infected nodes with a high probability on infinite Trees.
Spread of epidemic disease on networks.
- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.
Finding Adam in random growing trees
- Computer Science, MathematicsRandom Struct. Algorithms
- 2017
This work investigates algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model, and shows that for any ε, there exist such algorithms with K independent of the size of the input tree.
Rumor source detection for rumor spreading on random increasing trees
- Mathematics, Computer Science
- 2015
This paper derives asymptotic formulas for the detection probability of grown simple families of random increasing trees, which contain important random tree models as special cases, e.g., binary search trees, recursive trees and plane-oriented recursive trees.