Convex relaxation methods for community detection (Q2038282): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Community Detection and Stochastic Block Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Recovery in the Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed clustering and biclustering via semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex optimization for the planted \(k\)-disjoint-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite relaxations for the block model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Laplacian matrices and convex relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp nonasymptotic bounds on the norm of random matrices with independent entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust and computationally feasible community detection in the presence of arbitrary outlier nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexified modularity maximization for degree-corrected stochastic block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Graph Clustering / 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: Q2934076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How well do local algorithms solve semidefinite programs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality / 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: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse networks via Grothendieck's inequality / 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: Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probably certifiably correct \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions in semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral redemption in clustering sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do birds of a feather flock together? \(k\)-means, proximity, and conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5361316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolutely summing operators in $ℒ_{p}$-spaces and their applications / 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: Q5417661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How robust are reconstruction thresholds for community detection? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programs on sparse random graphs and their application to community detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness / 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: Consistency thresholds for the planted bisection model / 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: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating K‐means‐type Clustering via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering of sparse data via network communities—a prototype study of a large online market / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral clustering and the high-dimensional stochastic blockmodel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple SVD Algorithm for Finding Hidden Partitions / rank
 
Normal rank

Latest revision as of 03:17, 26 July 2024

scientific article
Language Label Description Also known as
English
Convex relaxation methods for community detection
scientific article

    Statements

    Convex relaxation methods for community detection (English)
    0 references
    0 references
    6 July 2021
    0 references
    community detection
    0 references
    degree correction
    0 references
    robustness
    0 references
    semidefinite program
    0 references
    strong consistency
    0 references
    weak consistency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers