Cooperative Computing for Autonomous Data Centers Storing Social Network Data, Jon Berry

We consider graph datasets that are distributed among several data centers with constrained sharing arrangements. We propose a formal model in which to design and analyze algorithms for this context along with two representative algorithms: s-t connectivity and planted clique discovery. The latter forced us to rethink recent conventional wisdom from social science regarding the clustering coefficient distributions of social networks. I will describe our process of cleaning social networks of human-implausible network structure in order to test our algorithms.