Inference for Networks
published: July 30, 2009, recorded: June 2009, views: 352
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
A great deal of attention has recently been paid to determining sub-communities on the basis of relations, corresponding to edges, between individuals, corresponding to vertices out of an unlabelled graph (Neman, SIAM Review 2003; Airoldi et al JMLR 2008; Leskovec & Kleinberg et al SIGKDD 2005) for probabilistic ergodic models of infinite unlabelled graphs. We drive consistency properties of the Newman-Girvon index, and develop an index with better consistency properties and better performance on simulated data sets. This is joint work with Aiyou Chen.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !