event
Inference for unlabelled graphs
Primary tabs
TITLE: Inference for unlabelled graphs
SPEAKER: Professor Peter Bickel
ABSTRACT:
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 of an unlabelled graph (Newman, SIAM Review 2003; Airoldi et al JMLR 2008; Leskovec & Kleinberg et al SIGKDD 2005). We have developed a nonparametric framework for probabilistic ergodic models of infinite unlabelled graphs (PNAS2009)and made some connections with modularities arising in the physics literature and community models in the social sciences.A fundamental difficulty in implementing these procedures is computational complexity.We develop approaches which bypass these difficulties.
(This is joint work with Aiyou Chen and Liza Levina)
Status
- Workflow Status:Published
- Created By:Anita Race
- Created:09/07/2010
- Modified By:Fletcher Moore
- Modified:10/07/2016
Categories
Keywords