Corpus ID: 227254912

Source location on multilayer networks

  title={Source location on multilayer networks},
  author={R. Paluch and Lukasz Gajewski and K. Suchecki and J. Hołyst},
Nowadays it is not uncommon to have to deal with dissemination on multi-layered networks and often finding the source of said propagation can be a crucial task. In this paper we tackle this exact problem with a maximum likelihood approach that we extend to be operational on multi-layered graphs. We test our method for source location estimation on synthetic networks and outline its potential strengths and limitations. We also observe some non-trivial and perhaps surprising phenomena where the… Expand
1 Citations

Figures from this paper

Detecting Hidden Layers from Spreading Dynamics on Complex Networks
This paper proposes methods for hidden layer identification and reconstruction and shows that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Expand


Locating the Source of Diffusion in Large-Scale Networks
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. Expand
Locating the source of spreading 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. Expand
Optimizing sensors placement in complex networks for localization of hidden signal source: A review
This paper investigates the problem of the optimal placement of such sensors in complex networks and proposes a new graph measure, called Collective Betweenness, which is compared against four other metrics and finds that while choosing the best method is very network and spread dependent, there are two methods that consistently stand out. Expand
Fast and accurate detection of spread source in large complex networks
The Gradient Maximum Likelihood Algorithm (GMLA) is proposed in which observers with low quality information are ignored and potential sources are selected based on the likelihood gradient from high quality observers. Expand
How to Identify an Infection Source With Limited Observations
This work considers the problem of estimating an infection source for a Susceptible-Infected model, and shows that an estimator for the source node associated with the most likely infection path that yields the limited observations is given by a Jordan center. Expand
Rumor source detection under probabilistic sampling
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. Expand
Information Source Detection in the SIR Model: A Sample-Path-Based Approach
  • Kai Zhu, Lei Ying
  • Computer Science, Physics
  • IEEE/ACM Transactions on Networking
  • 2016
This paper develops a sample-path-based approach to find the information source in a network in which the spread of information follows the popular Susceptible-Infected-Recovered (SIR) model, and proves that for infinite-trees, the estimator is a node that minimizes the maximum distance to the infected nodes and a reverse-infection algorithm is proposed to find such an estimator in general graphs. Expand
A novel source locating strategy without consistent assumptions
This paper first formulate the problem of locating source as inferring the parameters of propagation delays based on a set of observers, and proposes a novel reverse propagation strategy to locate infection source which has a higher accuracy than the traditional methods without the consistent assumptions. Expand
Inferring the origin of an epidemy with dynamic message-passing algorithm
An inference algorithm based on dynamic message-passing equations is introduced and it is shown that it leads to significant improvement of performance compared to existing approaches, and remains efficient in the case where the snapshot sees only a part of the network. Expand
Rumors in a Network: Who's the Culprit?
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. Expand