Computational lower bounds for community detection on random graphs

Keyphrases

• Random Graphs 100%
• Community Detection 100%
• Dense Communities 100%
• Computational Lower Bounds 100%
• Computational Complexity 50%
• Computationally Efficient 50%
• Computationally Intensive 50%
• Linear Time 50%
• Efficient Procedure 50%
• Hardness Results 50%
• Detection Problem 50%
• Small Communities 50%
• Erdos 50%
• Intensive Method 50%
• Phase Transition Phenomena 50%
• Edge Probability 50%
• Clique Detection 50%
• Average-case Hardness 50%
• Planted Clique 50%

Mathematics

• Community Detection 100%
• Random Graph 100%
• Probability Theory 50%
• Edge 50%
• Linear Time 50%
• Clique 50%
• Constant Factor 50%

Computer Science

• Random Graphs 100%
• Community Detection 100%
• Computational Complexity 50%
• Constant Factor 50%
• Subgraphs 50%
• Phase-Transition Phenomenon 50%