Abstract

Eigen-functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real-world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen-functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen-functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms.

Original languageEnglish (US)
Pages (from-to)121-135
Number of pages15
JournalStatistical Analysis and Data Mining
Volume10
Issue number2
DOIs
StatePublished - Apr 1 2017

Fingerprint

Dynamic Graphs
Eigenfunctions
Viruses
Virus
Infection
Graph in graph theory
Graph Mining
Threshold Graph
Timestamp
Linear Complexity
Centrality
Structural Change
Error Estimation
Countermeasures
Error analysis
High Accuracy
Monitor
Propagation
Robustness
Evaluation

Keywords

  • connectivity
  • dynamic graph
  • graph spectrum

ASJC Scopus subject areas

  • Analysis
  • Information Systems
  • Computer Science Applications

Cite this

On the eigen-functions of dynamic graphs : Fast tracking and attribution algorithms. / Chen, Chen; Tong, Hanghang.

In: Statistical Analysis and Data Mining, Vol. 10, No. 2, 01.04.2017, p. 121-135.

Research output: Contribution to journalArticle

@article{6558cf08d5074c8f9215923a397fcc3b,
title = "On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms",
abstract = "Eigen-functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real-world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen-functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen-functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms.",
keywords = "connectivity, dynamic graph, graph spectrum",
author = "Chen Chen and Hanghang Tong",
year = "2017",
month = "4",
day = "1",
doi = "10.1002/sam.11310",
language = "English (US)",
volume = "10",
pages = "121--135",
journal = "Statistical Analysis and Data Mining",
issn = "1932-1864",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - On the eigen-functions of dynamic graphs

T2 - Fast tracking and attribution algorithms

AU - Chen, Chen

AU - Tong, Hanghang

PY - 2017/4/1

Y1 - 2017/4/1

N2 - Eigen-functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real-world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen-functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen-functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms.

AB - Eigen-functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real-world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen-functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen-functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms.

KW - connectivity

KW - dynamic graph

KW - graph spectrum

UR - http://www.scopus.com/inward/record.url?scp=85016968689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016968689&partnerID=8YFLogxK

U2 - 10.1002/sam.11310

DO - 10.1002/sam.11310

M3 - Article

VL - 10

SP - 121

EP - 135

JO - Statistical Analysis and Data Mining

JF - Statistical Analysis and Data Mining

SN - 1932-1864

IS - 2

ER -