scalednap

MaRDI QIDQ7372020CRANFDO

Authors Alessandro Avellone, Paolo Bartesaghi, Stefano Benati, Rosanna Grassi

Last update 2 September 2026

Copyright license GNU General Public License, version 2.0, GNU General Public License, version 3.0

Software version identifier 1.0.0

Description

Finds the vertex partition of an undirected graph that maximises a persistence-based objective, using the Milano local-search algorithm. Three related quality measures are supported: the persistence probability of a community, its null-adjusted persistence (NAP), and the scaled null-adjusted persistence (Scaled-NAP), which interpolates between NAP and modularity. The methods are described in Avellone et al. (2023) <doi:10.1007/s10288-023-00559-z> and Avellone et al. (2025) <doi:10.1016/j.ins.2025.123032>.

Cites work

• Null-adjusted persistence function for high-resolution community detection
• On finding the community with maximum persistence probability

This page was built for software: scalednap