Search Results for author:
Found 5 papers, 2 papers with code
Combinatorial approach to spreading processes on networks
Existing theoretical approaches to the characterization of the models in terms of microscopic configurations rely on some approximation of independence among dynamical variables, thus introducing a systematic bias in the prediction of the ground-truth dynamics.
Physics and Society
Community detection in networks using graph embeddings
We compare their performance against that of traditional community detection algorithms.
Classical Information Theory of Networks
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks.
Finding statistically significant communities in networks
In this paper we present OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics.
Benchmark graphs for testing community detection algorithms
Community structure is one of the most important features of real networks and reveals the internal organization of the nodes.
Physics and Society Computational Physics
