activity
19992026
most citedCommunity detection in graphs

11.5k citations · 38.7k across the 103 of their papers we have counts for

collaborators
Showing 2009Show all

7 papers · 1 filter

physics.soc-ph2009★ 128 cited

Explosive percolation: a numerical analysis

Filippo Radicchi, Santo Fortunato

Percolation is one of the most studied processes in statistical physics. A recent paper by Achlioptas et al. [Science 323, 1453 (2009)] has shown that the percolation transition, w…

physics.soc-ph2009★ 2.2k cited

Community detection algorithms: a comparative analysis

Andrea Lancichinetti, Santo Fortunato

Uncovering the community structure exhibited by real networks is a crucial step towards an understanding of complex systems that goes beyond the local organization of their constit…

physics.soc-ph2009★ 332 cited

Diffusion of scientific credits and the ranking of scientists

Filippo Radicchi, Santo Fortunato, Benjamin Markines +1

Recently, the abundance of digital data enabled the implementation of graph based ranking algorithms that provide system level analysis for ranking publications and authors. Here w…

physics.soc-ph2009★ 180 cited

Explosive percolation in scale-free networks

Filippo Radicchi, Santo Fortunato

We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with…

physics.soc-ph2009★ 26 cited

Coevolution of Glauber-like Ising dynamics and topology

Salvatore Mandra', Santo Fortunato, Claudio Castellano

We study the coevolution of a generalized Glauber dynamics for Ising spins, with tunable threshold, and of the graph topology where the dynamics takes place. This simple coevolutio…

physics.soc-ph2009★ 11.5k cited

Community detection in graphs

Santo Fortunato

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is co…

physics.soc-ph2009★ 1k cited

Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities

Andrea Lancichinetti, Santo Fortunato

Many complex networks display a mesoscopic structure with groups of nodes sharing many links with the other nodes in their group and comparatively few with nodes of different group…