1. Belkin, M., & Niyogi, P. (2001). Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS, vol. 14 (pp. 585–591).
2. Fast unfolding of communities in large networks;Blondel;Journal of Statistical Mechanics: Theory and Experiment,2008
3. A comprehensive survey of graph embedding: Problems, techniques, and applications;Cai;IEEE Transactions on Knowledge and Data Engineering,2018
4. Cao, S., Lu, W., & Xu, Q. (2015). GraRep: Learning graph representations with global structural information. In Proceedings of the 24th ACM international on conference on information and knowledge management (pp. 891–900).
5. Learning community embedding with community detection and node embedding on graphs;Cavallari,2017