Community Detection
An algorithmic technique in graph theory that partitions a graph into densely connected subgroups called communities. In GraphRAG, it is used to divide a knowledge graph into semantic communities to support hierarchical retrieval.
Timeline (last 90 days)
The information-computation gap widely exists in high-dimensional statistical problems, such as sparse principal component analysis, the planted clique problem, and community detection, and is one of the most central open problems in the field of statistical computation.
The sparse spiked Wigner model is a core theoretical tool for matrix denoising and community detection, but when sparsity appears on both the signal and noise sides simultaneously, the problem becomes far more complex than one might imagine.
All Facts (2)
The information-computation gap widely exists in high-dimensional statistical problems, such as sparse principal component analysis, the planted clique problem, and community detection, and is one of the most central open problems in the field of statistical computation.
50%UnverifiedThe sparse spiked Wigner model is a core theoretical tool for matrix denoising and community detection, but when sparsity appears on both the signal and noise sides simultaneously, the problem becomes far more complex than one might imagine.
50%