Community detection using low-dimensional network embedding algorithms

• https://arxiv.org/abs/2111.05267

Community structure, Community detection, Community detectability, Graph embedding, Community detection with graph embedding

We prove that, given some fixed co-occurrence window, node2vec using random walks with a low non-backtracking probability can succeed for much sparser networks compared to DeepWalk using simple random walks.