Improved algorithms for the random cluster graph model

DOI10.1002/RSA.20181zbMATH Open1129.05049OpenAlexW4236232403MaRDI QIDQ5433271FDOQ5433271

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

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

zbMATH Keywords

clusteringplanted partition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Hill-climbing finds random planted bisections

Cited In (7)

• Population recovery and partial identification
• Fast online graph clustering via Erdős-Rényi mixture
• Batch edge-removal clustering based on random $k$NN graph
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Title not available (Why is that?)
• Generation of random clusters with specified degree of separation
• Compressive sensing for cut improvement and local clustering

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)