273 citations · 716 across the 8 of their papers we have counts for
3 papers · 1 filter
Improving the performance of algorithms to find communities in networks
Richard K. Darst, Zohar Nussinov, Santo Fortunato
Many algorithms to detect communities in networks typically work without any information on the cluster structure to be found, as one has no a priori knowledge of it, in general. N…
Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs
Richard K. Darst, David R. Reichman, Peter Ronhovde +1
We derive rigorous bounds for well-defined community structure in complex networks for a stochastic block model (SBM) benchmark. In particular, we analyze the effect of inter-commu…
An edge density definition of overlapping and weighted graph communities
Richard K. Darst David R. Reichman Peter Ronhovde, Zohar Nussinov
Community detection in networks refers to the process of seeking strongly internally connected groups of nodes which are weakly externally connected. In this work, we introduce and…