Search Results for author:
Found 3 papers, 2 papers with code
Robustness modularity in complex networks
Here we propose a new measure based on the concept of robustness: modularity is the probability to find trivial partitions when the structure of the network is randomly perturbed.
Community detection in networks using graph embeddings
We compare their performance against that of traditional community detection algorithms.
Fast consensus clustering in complex networks
Algorithms for community detection are usually stochastic, leading to different partitions for different choices of random seeds.
Physics and Society Social and Information Networks Molecular Networks
