Locating the Source of Diffusion in Large-Scale Networks

  title={Locating the Source of Diffusion in Large-Scale Networks},
  author={Pedro C. Pinto and Patrick Thiran and Martin Vetterli},
  journal={Physical review letters},
  volume={109 6},
How can we localize the source of diffusion in a complex network? Because of the tremendous size of many real networks-such as the internet or the human social graph-it is usually unfeasible to observe the state of all nodes in a network. We show that it is fundamentally possible to estimate the location of the source from measurements collected by sparsely placed observers. We present a strategy that is optimal for arbitrary trees, achieving maximum probability of correct localization. We… 

Figures and Tables from this paper

Network observability and localization of sources of diffusion in tree networks with missing edges

This work analyzes the problem of source localization, based on infection times of a subset of nodes in incompletely observed tree networks, under a simple propagation model, and considers the number of possible topologies that are consistent with the observed incomplete tree.

Network observability and localization of the source of diffusion based on a subset of nodes

This paper presents a model for the dynamics of network diffusion similar to state update of a linear time-varying system, and presents different methods to perform source localization depending on network observability.

Network observability for source localization in graphs with unobserved edges

This work analyzes the problem of selecting the minimum number of observed nodes that would lead to unambiguous source localization, i.e. achieve network observability, when both infection times of all the nodes, as well as the network structure cannot be fully observed.

Locating the Source of Diffusion in Complex Networks via Gaussian-Based Localization and Deduction

By modeling the informed times of the observers, this work derives an optimal source localization solution for arbitrary trees and then extends it to general graphs via proper approximations and can provide valuable insights on the interplay between information diffusion and source localization in complex networks.

Source Locating of Spreading Dynamics in Temporal Networks

An algorithm to solve the problem of locating the source in temporal networks, named the backward temporal diffusion process, and is, to the best of the knowledge, a frontier work in this field.

Locating the source of diffusion in complex networks by time-reversal backward spreading.

A time-reversal backward spreading algorithm to locate the source of a diffusion-like process efficiently and propose a general locatability condition that finds that the sources can be precisely located in arbitrary networks insofar as the locatable condition is assured.

Multiple propagation paths enhance locating the source of diffusion in complex networks




Spreading gossip in social networks.

It is found that the number of friendship connections strongly influences the probability of being gossiped and the spread factor is discussed, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other.

Epidemic spreading in scale-free networks.

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Spread of epidemic disease on networks.

  • M. Newman
  • Mathematics
    Physical 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.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Statistical mechanics of complex networks

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

Competitive cluster growth in complex networks.

The proposed idealized model for competitive cluster growth in complex networks shows that the cluster size distributions obtained when the growth process is performed on hierarchical networks have a scaling form similar to what has been observed for the distribution of a number of votes in an electoral process.

Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs.

A new family of networks are introduced that are simultaneously scale-free, small-world, Euclidean, space filling, and with matching graphs, that could be applied to the geometry of fully fragmented porous media, hierarchical road systems, and area-covering electrical supply networks.

Epidemics and percolation in small-world networks.

  • C. MooreM. Newman
  • Mathematics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and are given exact solutions for the position of this threshold in a variety of cases.

On spatially explicit models of cholera epidemics

The results suggest that in many cases of real-life epidemiological interest, time scales of disease dynamics may trigger outbreaks that significantly depart from the predictions of compartmental models.

Self-similar disk packings as model spatial scale-free networks.

The network of contacts in space-filling disk packings, such as the Apollonian packing, is examined. These networks provide an interesting example of spatial scale-free networks, where the topology