Fetching the paper…
Reading the bibliography…
Graph embedding is a transformation of nodes of a network into a set of vectors.
Holland, P.W., Laskey, K.B. and Leinhardt, S., 1983. Stochastic blockmodels: First steps. Social networks, 5(2), pp.109-137
1983
Earlier work this paper cites.
Lin, J., 1991. Divergence measures based on the Shannon entropy. IEEE Transactions on Information theory, 37(1), pp.145-151
1991
Earlier work this paper cites.
Girvan, M. and Newman, M.E., 2002. Community structure in social and biological networks. Proceedings of the national academy of sciences, 99(12), pp.7821-7826
2002
Earlier work this paper cites.
Hoff, P.D., Raftery, A.E. and Handcock, M.S., 2002. Latent space approaches to social network analysis. Journal of the american Statistical association, 97(460), pp.1090-1098
2002
Earlier work this paper cites.
Chung, F., Chung, F.R., Graham, F.C., Lu, L. and Chung, K.F., 2006. Complex graphs and networks (No. 107). American Mathematical Soc
2006
Earlier work this paper cites.
Gastner, M.T. and Newman, M.E., 2006. The spatial structure of networks. The European Physical Journal B-Condensed Matter and Complex Systems, 49(2), pp.247-252
2006
Earlier work this paper cites.
Blondel, V.D., Guillaume, J.L., Lambiotte, R. and Lefebvre, E., 2008. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10), p.P10008
2008
Earlier work this paper cites.
Lancichinetti, A., Fortunato, S. and Radicchi, F., 2008. Benchmark graphs for testing community detection algorithms. Physical review E, 78(4), p.046110
2008
Earlier work this paper cites.
Lancichinetti, A. and Fortunato, S., 2009. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80(1), p.016118
2009
Earlier work this paper cites.
Janssen, J., 2010, June. Spatial models for virtual networks. In Conference on Computability in Europe (pp. 201-210). Springer, Berlin, Heidelberg
2010
Earlier work this paper cites.
Expert, P., Evans, T.S., Blondel, V.D. and Lambiotte, R., 2011. Uncovering space-independent communities in spatial networks. Proceedings of the National Academy of Sciences, 108(19), pp.7663-7668
2011
Earlier work this paper cites.
Perrault-Joncas, D. and Meila, M., 2011. Directed graph embedding: an algorithm based on continuous limits of laplacian-type operators. Advances in Neural Information Processing Systems, 24, pp.990-998
2011
Earlier work this paper cites.
Zuev, K., Boguná, M., Bianconi, G. and Krioukov, D., 2015. Emergence of soft communities from geometric preferential attachment. Scientific reports, 5(1), pp.1-9
2015
Cited alongside, same era.
Grover, A. and Leskovec, J., 2016, August. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 855-864)
2016
Cited alongside, same era.
Krioukov, D., 2016. Clustering means geometry in networks. In APS March Meeting Abstracts (Vol. 2016, pp. Y12-005)
2016
Cited alongside, same era.
Leskovec, J. and Sosič, R., 2016. Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1), pp.1-20
2016
Cited alongside, same era.
Khosla, M., Leonhardt, J., Nejdl, W. and Anand, A., 2019, September. Node representation learning for directed graphs. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 395-411). Springer, Cham
2019
Later among the works it cites.
2020
Later among the works it cites.
Dernbach, S. and Towsley, D., 2020. Asymmetric Node Similarity Embedding for Directed Graphs. In Complex Networks XI (pp. 83-91). Springer, Cham
2020
Later among the works it cites.
Kamiński, B., Prałat, P. and Théberge, F., 2020. An unsupervised framework for comparing graph embeddings. Journal of Complex Networks, 8(5), p.cnz043
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
Paranjape, A., Benson, A.R. and Leskovec, J., 2017, February. Motifs in temporal networks. In Proceedings of the tenth ACM international conference on web search and data mining (pp. 601-610)
2017
Cited alongside, same era.
Zhou, C., Liu, Y., Liu, X., Liu, Z. and Gao, J., 2017, February. Scalable graph embedding for asymmetric proximity. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 31, No. 1)
2017
Cited alongside, same era.
Lu, Z., Wahlström, J. and Nehorai, A., 2018. Community detection in complex networks via clique conductance. Scientific reports, 8(1), pp.1-16
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Poulin, V. and Théberge, F., 2018, December. Ensemble clustering for graphs. In International Conference on Complex Networks and their Applications (pp. 231-243). Springer, Cham
2018
Cited alongside, same era.
Funke, T. and Becker, T., 2019. Stochastic block models: A comparison of variants and inference methods. PloS one, 14(4), p.e0215296
2019
Cited alongside, same era.
Kamiński, B., Prałat, P. and Théberge, F., 2020, September. A Scalable Unsupervised Framework for Comparing Graph Embeddings. In International Workshop on Algorithms and Models for the Web-Graph (pp. 52-67). Springer, Cham
2020
Later among the works it cites.
Aggarwal, M. and Murty, M.N., 2021. Machine Learning in Social Networks: Embedding Nodes, Edges, Communities, and Graphs. Springer Nature
2021
Closest in time.
Chen, H., Yang, C., Zhang, X., Liu, Z., Sun, M. and Jin, J., 2021. From Symbols to Embeddings: A Tale of Two Representations in Computational Social Science. Journal of Social Computing, 2(2), pp.103-156
2021
Closest in time.
Kamiński, B., Prałat, P. and Théberge, F., 2021. Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure. Network Science, pp.1-26
2021
Closest in time.
Tandon, A., Albeshri, A., Thayananthan, V., Alhalabi, W., Radicchi, F. and Fortunato, S., 2021. Community detection in networks using graph embeddings. Physical Review E, 103(2), p.022316
2021
Closest in time.
Zhou, T., 2021. Progresses and Challenges in Link Prediction. arXiv preprint arXiv:2102.11472
2021
Closest in time.
Kamiński, B., Prałat, P. and Théberge, F., 2022, Mining Complex Networks. Chapman and Hall/CRC
2022
Closest in time.