On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms

@article{Chen2017OnTE,
  title={On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms},
  author={Chen Chen and Hanghang Tong},
  journal={Statistical Analysis and Data Mining},
  year={2017},
  volume={10},
  pages={121-135}
}
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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 10 times. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 67 references

Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws

2008 Eighth IEEE International Conference on Data Mining • 2008
View 4 Excerpts
Highly Influenced

Spectral graph theory

F.R.K. Chung
Amn Math Soc • 1997
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…