Login / Signup
Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs.
Richard K. Darst
David R. Reichman
Peter Ronhovde
Zohar Nussinov
Published in:
J. Complex Networks (2015)
Keyphrases
</>
hyper graph
community detection
probabilistic model
graph clustering
objective function
k means
random walk
dynamic programming
graph model
community detection algorithms
social networks
graph structure
real world graphs
massive graphs