This document summarizes a study on clustering probabilistic graphs. The study extends the definition of graph clustering to probabilistic graphs using an edit-distance-based objective function. It connects this objective function to correlation clustering to develop practical approximation algorithms. The algorithms discover the correct number of clusters in a probabilistic protein-protein interaction network and identify established protein relationships. The techniques also proved practical on a large social network with one billion edges.