This is the program for the 2010 Joint Statistical Meetings in Vancouver, British Columbia.

Abstract Details

Activity Number: 532
Type: Contributed
Date/Time: Wednesday, August 4, 2010 : 10:30 AM to 12:20 PM
Sponsor: Section on Statistical Learning and Data Mining
Abstract - #306760
Title: An Example of Performance Analysis for Network Community Detection
Author(s): Luke Fostvedt*+ and Dan Nordman and Alyson Wilson
Companies: Iowa State University and Iowa State University and Iowa State University
Address: 1205 Snedecor Hall, Ames, IA, 50011,
Keywords: Community Detection ; Erdos Renyi ; Random Graph ; Scale-Free
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).


The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.

Back to the full JSM 2010 program




2010 JSM Online Program Home

For information, contact jsm@amstat.org or phone (888) 231-3473.

If you have questions about the Continuing Education program, please contact the Education Department.