JSM 2010: An Example of Performance Analysis for Network Community Detection

Abstract:¬†Community detection algorithms have many applications ranging from search engines on the world wide web to the detection terrorist networks. While the computer scientists are trying to detect “clumpiness” in networks, as statisticians we are analyzing the performance of the algorithm. We pick a node and determine its expected number of neighbors with a degree greater than or equal to this chosen node. This is colloquially referred to the number of nodes in the chosen node’s “bucket”. We show that, for a multigraph with an arbitrary node degree distribution, both the number of nodes in the bucket and the number of pairs of nodes in the bucket are asymptotically finite. This is in contrast to an Erdos Renyi random graph where this quantity increases with O(n).

Poster: JSM 2010 Poster