Improved algorithms for the random cluster graph model

DOI10.1002/RSA.20181MaRDI QIDQ5433271zbMATH OpenOpenAlexFDO

Authors Ron Shamir, Dekel Tsur

Publication date 8 January 2008

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20181

zbMATH Keywords

clusteringplanted partition

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial probability (60C05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• scientific article; zbMATH DE number 2089226
• A simple spectral algorithm for recovering planted partitions
• scientific article; zbMATH DE number 3971865
• Reconstruction and estimation in the planted partition model
• Max Cut for Random Graphs with a Planted Partition

Cites work

• Hill-climbing finds random planted bisections
• scientific article; zbMATH DE number 1505656 (Why is no real title available?)

Cited in

(7)

• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Population recovery and partial identification
• Generation of random clusters with specified degree of separation
• scientific article; zbMATH DE number 2089226 (Why is no real title available?)
• Compressive sensing for cut improvement and local clustering
• Batch edge-removal clustering based on random kNN graph
• Fast online graph clustering via Erdős-Rényi mixture

This page was built for publication: Improved algorithms for the random cluster graph model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433271)