Fast Eigen-Functions Tracking on Dynamic Graphs
暂无分享,去创建一个
[1] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[2] V. N. Bogaevski,et al. Matrix Perturbation Theory , 1991 .
[3] Christos Faloutsos,et al. Epidemic thresholds in real networks , 2008, TSEC.
[4] Christos Faloutsos,et al. Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..
[5] Jorma Rissanen,et al. The Minimum Description Length Principle in Coding and Modeling , 1998, IEEE Trans. Inf. Theory.
[6] U. Feige,et al. Spectral Graph Theory , 2015 .
[7] Michalis Faloutsos,et al. Threshold conditions for arbitrary cascade models on arbitrary networks , 2011, 2011 IEEE 11th International Conference on Data Mining.
[8] Wu Jun,et al. Natural Connectivity of Complex Networks , 2010 .
[9] F. Harary,et al. The spectral approach to determining the number of walks in a graph , 1979 .
[10] Yihong Gong,et al. Incremental spectral clustering by efficiently updating the eigen-system , 2010, Pattern Recognit..
[11] Michalis Faloutsos,et al. Gelling, and melting, large graphs by edge manipulation , 2012, CIKM.
[12] Christos Faloutsos,et al. Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly Detection , 2012, SDM.
[13] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.
[14] Charalampos E. Tsourakakis. Counting triangles in real-world networks using projections , 2011, Knowledge and Information Systems.
[15] Charalampos E. Tsourakakis. Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[16] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[17] Christos Faloutsos,et al. EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs , 2009, 2009 IEEE International Conference on Data Mining Workshops.
[18] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[19] Christos Faloutsos,et al. Monitoring Network Evolution using MDL , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[20] Donald F. Towsley,et al. The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[21] Christos Faloutsos,et al. On the Vulnerability of Large Graphs , 2010, 2010 IEEE International Conference on Data Mining.
[22] Philip S. Yu,et al. Fast Monitoring Proximity and Centrality on Time‐evolving Bipartite Graphs , 2008, Stat. Anal. Data Min..
[23] Stefan Burr,et al. The Mathematics of networks , 1982 .
[24] Charu C. Aggarwal,et al. Evolutionary Network Analysis , 2014, ACM Comput. Surv..
[25] Massimo Marchiori,et al. Error and attacktolerance of complex network s , 2004 .
[26] I. Frisch,et al. Analysis and Design of Survivable Networks , 1970 .
[27] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[28] Hisashi Kashima,et al. Eigenspace-based anomaly detection in computer systems , 2004, KDD.
[29] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[30] Hanghang Tong,et al. Make It or Break It: Manipulating Robustness in Large Networks , 2014, SDM.