Inference for unlabelled graphs

Event Details
  • Date/Time:
    • Tuesday September 14, 2010
      12:00 pm - 1:00 pm
  • Location: ISyE Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Inference for unlabelled graphs

Full Summary: No summary paragraph submitted.

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)

Additional Information

In Campus Calendar
No
Groups

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
No categories were selected.
Keywords
No keywords were submitted.
Status
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Sep 7, 2010 - 6:03am
  • Last Updated: Oct 7, 2016 - 9:52pm