2.2k citations · 3k across the 23 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cond-mat.stat-mech2011★ 403 cited
Phase transition in the detection of modules in sparse networks
Aurelien Decelle, Florent Krzakala, Cristopher Moore +1
We present an asymptotically exact analysis of the problem of detecting communities in sparse random networks. Our results are also applicable to detection of functional modules, p…
cond-mat.dis-nn2011★ 1 cited
Parallel Complexity of Random Boolean Circuits
Jon Machta, Simon DeDeo, Stephan Mertens +1
Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst…