Spectral Graph Complexity
暂无分享,去创建一个
Emmanuel Müller | Alexander M. Bronstein | Panagiotis Karras | Davide Mottin | Anton Tsitsulin | A. Bronstein | D. Mottin | Emmanuel Müller | Anton Tsitsulin | Panagiotis Karras
[1] David F. Gleich,et al. Heat kernel based community detection , 2014, KDD.
[2] Emmanuel Müller,et al. VERSE: Versatile Graph Embeddings from Similarity Measures , 2018, WWW.
[3] David J. Singer,et al. A network complexity metric based on planarity and community structure , 2014, J. Complex Networks.
[4] Emmanuel Müller,et al. NetLSD: Hearing the Shape of a Graph , 2018, KDD.
[5] Emmanuel Abbe,et al. Exact Recovery in the Stochastic Block Model , 2014, IEEE Transactions on Information Theory.
[6] Kaushik Sinha,et al. Matrix Energy as a Measure of Topological Complexity of a Graph , 2016, ArXiv.
[7] Bergfinnur Durhuus. Hausdorff and Spectral Dimension of Infinite Graphs , 2009 .
[8] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[9] Joshua D. Summers,et al. Accuracy and Precision Analysis of the Graph Complexity Connectivity Method , 2016 .
[10] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[11] Aaron Clauset,et al. Scale-free networks are rare , 2018, Nature Communications.
[12] H. Weyl. Ueber die asymptotische Verteilung der Eigenwerte , 1911 .
[13] Ginestra Bianconi,et al. Synchronization in network geometries with finite spectral dimension. , 2018, Physical review. E.
[14] Ryan A. Rossi,et al. The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.
[15] Mikhail Belkin,et al. Consistency of spectral clustering , 2008, 0804.0678.
[16] Steven Skiena,et al. DeepWalk: online learning of social representations , 2014, KDD.
[17] N. Abreu. Old and new results on algebraic connectivity of graphs , 2007 .
[18] Fan Chung,et al. Spectral Graph Theory , 1996 .
[19] Jurgen Kurths,et al. Synchronization in complex networks , 2008, 0805.2976.
[20] Ginestra Bianconi,et al. Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free , 2015, Scientific Reports.
[21] K. Varmuza,et al. A Large Scale Analysis of Information-Theoretic Network Complexity Measures Using Chemical Structures , 2009, PloS one.