Fetching the paper…
Reading the bibliography…
In this paper we propose a lightning fast graph embedding method called one-hot graph encoder embedding.
W. M. Rand, “Objective criteria for the evaluation of clustering methods,” Journal of the American Statistical Association , vol. 66, no. 336, pp. 846–850, 1971
1971
Earlier work this paper cites.
P. Holland, K. Laskey, and S. Leinhardt, “Stochastic blockmodels: First steps,” Social Networks , vol. 5, no. 2, pp. 109–137, 1983
1983
Earlier work this paper cites.
B. Efron and R. Tibshirani, An introduction to the bootstrap . Chapman & Hall, 1993
1993
Earlier work this paper cites.
T. Snijders and K. Nowicki, “Estimation and prediction for stochastic blockmodels for graphs with latent block structure,” Journal of Classification , vol. 14, no. 1, pp. 75–100, 1997
1997
Earlier work this paper cites.
M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of National Academy of Science , vol. 99, no. 12, pp. 7821–7826, 2002
2002
Earlier work this paper cites.
L. Adamic and N. Glance, “The political blogosphere and the 2004 us election: Divided they blog,” in Proceedings of the 3rd International Workshop on Link Discovery . New York: ACM Press, 2005, pp. 36–43
2005
Earlier work this paper cites.
M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E , vol. E 74, no. 036104, 2006
2006
Earlier work this paper cites.
S. Young and E. Scheinerman, “Random dot product graph models for social networks,” in Algorithms and Models for the Web-Graph . Springer Berlin Heidelberg, 2007, pp. 138–149
2007
Earlier work this paper cites.
G. Szekely, M. Rizzo, and N. Bakirov, “Measuring and testing independence by correlation of distances,” Annals of Statistics , vol. 35, no. 6, pp. 2769–2794, 2007
2007
Earlier work this paper cites.
K. Rohe, S. Chatterjee, and B. Yu, “Spectral clustering and the high-dimensional stochastic blockmodel,” Annals of Statistics , vol. 39, no. 4, pp. 1878–1915, 2011
2011
Earlier work this paper cites.
B. Karrer and M. E. J. Newman, “Stochastic blockmodels and community structure in networks,” Physical Review E , vol. 83, p. 016107, 2011
2011
Earlier work this paper cites.
D. Sussman, M. Tang, D. Fishkind, and C. Priebe, “A consistent adjacency spectral embedding for stochastic blockmodel graphs,” Journal of the American Statistical Association , vol. 107, no. 499, pp. 1119–1128, 2012
2012
Cited alongside, same era.
Y. Zhao, E. Levina, and J. Zhu, “Consistency of community detection in networks under degree-corrected stochastic block models,” Annals of Statistics , vol. 40, no. 4, pp. 2266–2292, 2012
2012
Cited alongside, same era.
M. Tang, D. L. Sussman, and C. E. Priebe, “Universally consistent vertex classification for latent positions graphs,” Annals of Statistics , vol. 41, no. 3, pp. 1406–1430, 2013
2013
Cited alongside, same era.
J. T. Vogelstein, Y. Park, T. Ohyama, R. Kerr, J. Truman, C. E. Priebe, and M. Zlatic, “Discovery of brainwide neural-behavioral maps via multiscale unsupervised structure learning,” Science , vol. 344, no. 6182, pp. 386–392, 2014
2014
Cited alongside, same era.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 855–864
2016
Later among the works it cites.
2016
Later among the works it cites.
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, and C. E. Priebe, “A nonparametric two-sample hypothesis testing for random dot product graphs,” Bernoulli , vol. 23, no. 3, pp. 1590–1630, 2017
2017
Later among the works it cites.
C. Gao, Z. Ma, A. Y. Zhang, and H. H. Zhou, “Achieving optimal misclassification proportion in stochastic block models,” Journal of Machine Learning Research , vol. 18, pp. 1–45, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Sussman, M. Tang, and C. Priebe, “Consistent latent position estimation and vertex classification for random dot product graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 1, pp. 48–57, 2014
2014
Cited alongside, same era.
S. S. Bryan Perozzi, Rami Al-Rfou, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Cited alongside, same era.
R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in AAAI , 2015. [Online]. Available: https://networkrepository.com
2015
Cited alongside, same era.
S. Bhattacharyya and P. J. Bickel, “Subsampling bootstrap of count features of networks,” Annals of Statistics , vol. 43, pp. 2384–2411, 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
L. Chen, C. Shen, J. T. Vogelstein, and C. E. Priebe, “Robust vertex classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 38, no. 3, pp. 578–590, 2016
2016
Cited alongside, same era.
H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, “Local higher-order graph clustering,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2017, p. 555–564
2017
Later among the works it cites.
C. Priebe, Y. Parker, J. Vogelstein, J. Conroy, V. Lyzinskic, M. Tang, A. Athreya, J. Cape, and E. Bridgeford, “On a ’two truths’ phenomenon in spectral graph clustering,” Proceedings of the National Academy of Sciences , vol. 116, no. 13, pp. 5995–5600, 2019
2019
Later among the works it cites.
B. Rozemberczki and R. Sarkar, “Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models,” in Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM ’20) . ACM, 2020, p. 1325–1334
2020
Later among the works it cites.
R. Liu and A. Krishnan, “Pecanpy: a fast, efficient and parallelized python implementation of node2vec,” Bioinformatics , vol. 37, no. 19, pp. 3377–3379, 2021
2021
Closest in time.
A. Green and C. R. Shalizi, “Bootstrapping exchangeable random graphs,” Electronic Journal of Statistics , vol. 16, no. 1, pp. 1058–1095, 2022
2022
Closest in time.