Analysis of the modern algorithms’ accuracy for communities identification on networks when working with graph databases

In this paper, we consider methods for extracting communities in networksusing various algorithms. The Girvan-Newman, Louvain, Walktrap and Leiden algorithms were presented and the results of their application on the Wikipedia graph were analyzed. Various metrics were used to assess the quality of the isolated communities, and the results were stored in the Neo4j graph database. The results showed that the Leiden and Louvain algorithms with a resolution equal to one showed the best results compared to other algorithms.