Metraipolis › archive › dc_58c657ee718d
Diffusion-Induced Spatial Attention Overlapping Community Detection — arXiv:2609.26737
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26737
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T14:41:39.294Z
- SHA-256 of the archived text
f7c05bdb1d7c07d2fcd6f47eb262f9e6b819dd07c29783fa9e023b456ed14d5c- Stable URL of this page
https://metraipolis.com/documento/dc_58c657ee718d
How to cite
Diffusion-Induced Spatial Attention Overlapping Community Detection — arXiv:2609.26737 — arXiv (en), https://arxiv.org/abs/2609.26737 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_58c657ee718d (Metraipolis archive dc_58c657ee718d, sha256 f7c05bdb1d7c07d2fcd6f47eb262f9e6b819dd07c29783fa9e023b456ed14d5c)
BibTeX
@misc{dc58c657ee718d,
title = {Diffusion-Induced Spatial Attention Overlapping Community Detection — arXiv:2609.26737},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26737},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_58c657ee718d; sha256 f7c05bdb1d7c07d2fcd6f47eb262f9e6b819dd07c29783fa9e023b456ed14d5c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26737. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Detection of overlapping communities is essential for modelling networks in which nodes participate simultaneously in multiple structural or functional groups. Existing graph neural network approaches commonly rely on local message passing, which can obscure community boundaries through smoothing and limit the representation of structurally relevant long-range dependencies. We introduce Diffusion-Induced Spatial Attention Community Detection (DISCO), a deep-learning framework that combines a structural prior derived from influence spreading dynamics, sparse multi-head attention, and non-negative community-affiliation learning. The prior identifies candidate interactions beyond immediate graph neighbours and biases attention according to their structural proximity, while a Bernoulli-Poisson edge-reconstruction objective enables overlapping community inference from node attributes and structural profiles, or both. Benchmark experiments show that DISCO performs competitively against established graph convolutional and graph attention approaches across different input configurations. To demonstrate its practical applicability, we present a proof-of-concept cybersecurity use case in which changes between community assignments inferred from consecutive communication-network snapshots provide an interpretable anomaly signal. Temporal community similarity identifies structural deviations, while node-level contributions help locate the devices associated with them. DISCO therefore provides both a flexible method for overlapping community detection and a foundation for analysing structural change in dynamic networks. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-23 in cs.SI). Categorie arXiv: Social and Information Networks (cs.SI) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.26737 — 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-08T13:54:55.658Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).