Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rotation of Eigenvectors by a Perturbation. III / 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 hidden cliques of size \(\sqrt{N/e}\) in nearly linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving Exact Cluster Recovery Threshold via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Limits for Recovering a Hidden Community / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques Elude the Metropolis Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral redemption in clustering sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection thresholds and the weak Ramanujan property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares Lower Bounds for Planted Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding one community in a sparse graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency thresholds for the planted bisection model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction and estimation in the planted partition model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315288 / rank
 
Normal rank

Latest revision as of 17:01, 16 July 2024

scientific article; zbMATH DE number 6943642
Language Label Description Also known as
English
Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time
scientific article; zbMATH DE number 6943642

    Statements

    Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 September 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hidden community
    0 references
    belief propagation
    0 references
    message passing
    0 references
    spectral algorithms
    0 references
    high-dimensional statistics
    0 references
    0 references
    0 references