# Overlapping Community Detection by Local Decentralised Vertex-centred Process

## TL;DR

This paper introduces LOCNeSs, a decentralized algorithm for detecting overlapping communities in networks, optimized for mobile environments, leveraging preferential attachment to identify nodes belonging to multiple communities effectively.

## Contribution

It presents a novel decentralized algorithm, LOCNeSs, designed specifically for mobile networks to detect overlapping communities with limited propagation.

## Key findings

- LOCNeSs is stable across various network scenarios.
- The algorithm effectively identifies overlapping vertices.
- It performs well in decentralized, mobile network environments.

## Abstract

This paper focuses on the identification of overlapping communities, allowing nodes to simultaneously belong to several communities, in a decentralised way. To that aim it proposes LOCNeSs, an algorithm specially designed to run in a decentralised environment and to limit propagation, two essential characteristics to be applied in mobile networks. It is based on the exploitation of the preferential attachment mechanism in networks. Experimental results show that LOCNeSs is stable and achieves good overlapping vertex identification.