papersSEP 10 04:00 UTC
Study examines robustness of shallow graph embeddings for community detection
A paper on arXiv investigates how well shallow graph embedding methods for community detection hold up when networks undergo perturbations, focusing on node deletions. It evaluates whether low-dimensional node representations preserve community structure as the underlying graph changes. The work offers insight into when these embedding techniques remain reliable in practice.