Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs.
Richard K. DarstDavid R. ReichmanPeter RonhovdeZohar NussinovPublished in: CoRR (2013)
Keyphrases
- hyper graph
- community detection
- probabilistic model
- random walk
- objective function
- k means
- combinatorial optimization
- social networks
- graph clustering
- learning algorithm
- optimal solution
- dynamic programming
- machine learning
- graph structure
- graph partitioning
- active learning
- complex networks
- network analysis
- community detection algorithms