Finding one community in a sparse graph (Q892403): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1502.05680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large average submatrices in high dimensional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral techniques applied to sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some spin glass ideas applied to the clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques Elude the Metropolis Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hidden Cliques in Linear Time with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Physics of Spin Glasses and Information Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral redemption in clustering sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quiet Planting in the Locked Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of locally-globally convergent graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local algorithms for independent sets are half-optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning via Adaptive Spectral Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the block model threshold conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions for the cavity approach to the clique problem on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Transport / rank
 
Normal rank

Latest revision as of 02:09, 11 July 2024

scientific article
Language Label Description Also known as
English
Finding one community in a sparse graph
scientific article

    Statements

    Finding one community in a sparse graph (English)
    0 references
    19 November 2015
    0 references
    random graphs
    0 references
    cavity method
    0 references
    statistical inference
    0 references
    hidden clique
    0 references
    polynomial algorithms
    0 references
    phase transitions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references