Computational Complexity, Phase Transitions, and Message-Passing for Community Detection.
Aurelien DecelleJanina HüttelAlaa SaadeCristopher MoorePublished in: CoRR (2014)
Keyphrases
- message passing
- community detection
- phase transition
- computational complexity
- np complete
- belief propagation
- complex networks
- network analysis
- constraint satisfaction
- social networks
- distributed systems
- random constraint satisfaction problems
- community structure
- shared memory
- link prediction
- graph mining
- markov random field
- np hard
- random graphs
- sum product
- inference in graphical models
- decision problems
- cellular automata
- community detection algorithms
- random instances
- graphical models
- overlapping communities
- network structure
- constraint satisfaction problems
- bit rate
- search algorithm
- social network analysis
- simulated annealing
- sum product algorithm
- data structure
- reinforcement learning