skip to content

Repeated Motif Hierarchical Stochastic Blockmodels

Presented by: 
Carey Priebe Johns Hopkins University
Friday 15th July 2016 - 14:30 to 15:00
INI Seminar Room 1
Co-authors: Vince Lyzinski (Johns Hopkins University), Minh Tang (Johns Hopkins University), Avanti Athreya (Johns Hopkins University), Youngser Park (Johns Hopkins University), Joshua Vogelstein (Johns Hopkins University), Keith Levin (Johns Hopkins University)

Based on our methodology for community detection and community comparison in graphs (Lyzinski et al., 2015,, we formulate a model selection procedure for deciding whether a hierarchical stochastic blockmodel graph supports the conjecture of repeated motifs. Such a graph inference procedure promises to address a fundamental outstanding question regarding the atoms of neural computation (Marcus, Marblestone & Dean, 2014,
Related Links
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons