Oct. 25, 2022, 1:12 a.m. | Yichi Zhang, Minh Tang

cs.LG updates on arXiv.org arxiv.org

Random-walk based network embedding algorithms like DeepWalk and node2vec are
widely used to obtain Euclidean representation of the nodes in a network prior
to performing downstream inference tasks. However, despite their impressive
empirical performance, there is a lack of theoretical results explaining their
large-sample behavior. In this paper, we study node2vec and DeepWalk through
the perspective of matrix factorization. In particular, we analyze these
algorithms in the setting of community detection for stochastic blockmodel
graphs (and their degree-corrected variants). By …

arxiv community deepwalk node2vec recovery

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne