Metraipolis › archive › dc_a0ecbc57317c
Community Detection using the Edge Laplacian Dynamics vis-a-vis Ricci Flow — arXiv:2609.38988
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38988
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T13:42:43.535Z
- SHA-256 of the archived text
3d086cd3608d9cba3d8415d7b7c29a4ad0869165abdcc2a7219c6926a0d9781c- Stable URL of this page
https://metraipolis.com/documento/dc_a0ecbc57317c
How to cite
Community Detection using the Edge Laplacian Dynamics vis-a-vis Ricci Flow — arXiv:2609.38988 — arXiv (en), https://arxiv.org/abs/2609.38988 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a0ecbc57317c (Metraipolis archive dc_a0ecbc57317c, sha256 3d086cd3608d9cba3d8415d7b7c29a4ad0869165abdcc2a7219c6926a0d9781c)
BibTeX
@misc{dca0ecbc57317c,
title = {Community Detection using the Edge Laplacian Dynamics vis-a-vis Ricci Flow — arXiv:2609.38988},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38988},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a0ecbc57317c; sha256 3d086cd3608d9cba3d8415d7b7c29a4ad0869165abdcc2a7219c6926a0d9781c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38988. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
It has been found that utilizing the geometric properties of the graph dynamics can bring out crucial information of the data that a statistical analysis will not. The properties of Ricci flow bring out hidden dynamics of the data in the same way as decomposition of smooth manifolds. In this paper we explore an alternative to Ricci flow, where we find that we can bring out similar properties like it using a simpler and well defined Edge Laplacian to practice community detection in graphs. Moreover, the results obtained by the present approach show that a flow driven by the Edge Laplacian yields results similar to those of the Ricci flow. In contrast, computing the Forman-Ricci curvature requires looping over the adjacent edges, while computing Olivier-Ricci curvature involves the computation of Wasserstein distance and probability distribution associated with the graph nodes, making the Edge Laplacian approach computationally more efficient. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-10-01 in cs.SI). Categorie arXiv: Dynamical Systems (math.DS) ; Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2609.38988 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T13:15:51.627Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).