Searching Information Sources in Networks

Abstract

During the course of this project, we made significant progresses in multiple directions of the information detection problem. These progresses include: (1) The development of the first algorithm that is asymptotic optimal for the Erdos-Renyi (ER) random graph when the infection time is less than 2/3 tu: The algorithm is called the Short-Fat-Tree (SFT) algorithm and is the first algorithm and the first theoretical result on information source detection on non-tree networks; (2) The development of information source localization algorithms to detect multiple information sources.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 14, 2017
Accession Number
AD1050777

Entities

People

  • Lei Ying

Organizations

  • Arizona State University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Artificial Intelligence
  • Autonomous Systems
  • Computational Complexity
  • Computer Communications
  • Data Mining
  • Detection
  • Diffusion
  • Digital Signal Processing
  • Electrical Grids
  • Estimators
  • Infection
  • Information Science
  • Information Theory
  • Load Monitoring
  • Network Science
  • Networks
  • Online Communications
  • Probability
  • Signal Processing
  • Simulations
  • Social Networks
  • Wound Infections

Fields of Study

  • Computer science

Readers

  • Molecular Biology and Genetics
  • Neural Network Machine Learning.