Shengmin Jin
ABSTRACT
Network representation learning has played a critical role in studying networks. One way to study a graph is to focus on its spectrum, i.e., the eigenvalue distribution of its associated matrices. Recent advancements in spectral graph theory show that spectral moments of a network can be used to capture the network structure and various graph properties. However, sometimes networks with different structures or sizes can have the same or similar spectral moments, not to mention the existence of the cospectral graphs. To address such problems, we propose a 3D network representation that relies on the spectral information of subgraphs: the Spectral Path, a path connecting the spectral moments of the network and those of its subgraphs of different sizes. We show that the spectral path is interpretable and can capture relationship between a network and its subgraphs, for which we present a theoretical foundation. We demonstrate the effectiveness of the spectral path in applications such as network visualization and network identification.
- Béla Bollobás. 1990. Almost every graph has reconstruction number three. Journal of Graph Theory 14, 1 (1990), 1--4.Google Scholar
Digital Library
- Steve Butler and Jason Grout. 2010. A construction of cospectral graphs for the normalized Laplacian. arXiv preprint arXiv:1008.3646 (2010).Google Scholar
- Steven Kay Butler. 2008. Eigenvalues and structures of graphs. Ph.D. Dissertation. UC San Diego.Google Scholar
- Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jurij Leskovec, and Christos Faloutsos. 2008. Epidemic thresholds in real networks. ACM Transactions on Information and System Security (TISSEC) 10, 4 (2008), 1--26.Google ScholarDigital Library
- Jeff Cheeger. 2015. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in analysis. Princeton University Press, 195--200.Google Scholar
- Fan RK Chung and Fan Chung Graham. 1997. Spectral graph theory. Number 92. American Mathematical Soc.Google Scholar
- David Cohen-Steiner, Weihao Kong, Christian Sohler, and Gregory Valiant. 2018. Approximating the Spectrum of a Graph. In SIGKDD. ACM, 1263--1271.Google Scholar
- Kun Dong, Austin R Benson, and David Bindel. 2019. Network density of states. In Proceedings of the 25th ACM SIGKDD. 1152--1161.Google ScholarDigital Library
- Shengmin Jin, Vir V Phoha, and Reza Zafarani. 2019. Network Identification and Authentication. In 2019 International Conference on Data Mining (ICDM). IEEE.Google Scholar
- Shengmin Jin and Reza Zafarani. 2020. The Spectral Zoo of Networks: Embedding and Visualizing Networks with Spectral Moments. In Proceedings of the SIGKDD.Google ScholarDigital Library
- Paul J Kelly et al. 1957. A congruence theorem for trees. Pacific J. Math. 7, 1 (1957), 961--968.Google ScholarCross Ref
- Jure Leskovec and Christos Faloutsos. 2006. Sampling from large graphs. In Proceedings of the SIGKDD. ACM, 631--636.Google ScholarDigital Library
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google Scholar
- Jan R Magnus and Heinz Neudecker. 2019. Matrix differential calculus with applications in statistics and econometrics. John Wiley & Sons.Google Scholar
- Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang Liu, and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (2017).Google Scholar
- Peter V O'Neil. 1970. Ulam's conjecture and graph reconstructions. The American Mathematical Monthly 77, 1 (1970), 35--43.Google ScholarCross Ref
- Edouard Pineau. 2019. Using Laplacian Spectrum as Graph Feature Representation. arXiv preprint arXiv:1912.00735 (2019).Google Scholar
- Ryan Rossi and Nesreen Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization.. In AAAI, Vol. 15. 4292--4293.Google Scholar
- Allen J Schwenk. 1973. Almost all trees are cospectral. New directions in the theory of graphs (1973), 275--307.Google Scholar
- Anton Tsitsulin, Davide Mottin, Panagiotis Karras, Alexander Bronstein, and Emmanuel Müller. 2018. Netlsd: hearing the shape of a graph. In KDD. 2347--2356.Google Scholar
- StanislawMUlam. 1960. A collection of mathematical problems. Vol. 8. Interscience Publishers.Google Scholar
- Saurabh Verma and Zhi-Li Zhang. 2017. Hunt for the unique, stable, sparse and fast feature learning on graphs. In NeurIPS. 88--98.Google Scholar
- Richard C Wilson and Ping Zhu. 2008. A study of graph spectra for comparing graphs and trees. Pattern Recognition 41, 9 (2008), 2833--2841.Google ScholarDigital Library
- R. Zafarani and H. Liu. 2009. Social Computing Data Repository at ASU. http://socialcomputing.asu.eduGoogle Scholar
- Yutao Zhang, Jie Tang, Zhilin Yang, Jian Pei, and Philip S Yu. 2015. Cosnet: Connecting heterogeneous social networks with local and global consistency. In Proceedings of the 21th ACM SIGKDD. ACM, 1485--1494.Google ScholarDigital Library
Index Terms
- A Spectral Representation of Networks: The Path of Subgraphs
Recommendations
Forbidden Subgraphs and Weak Locally Connected Graphs
A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...
Bipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n^' be the maximum number of vertices in an induced bipartite subgraph of G and let m^' be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G)=m^'/m is called the bipartite ...
Forbidden subgraphs that imply 2-factors
The connected forbidden subgraphs and pairs of connected forbidden subgraphs that imply a 2-connected graph is hamiltonian have been characterized by Bedrossian [Forbidden subgraph and minimum degree conditions for hamiltonicity, Ph.D. Thesis, Memphis ...
Comments