University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Repeated Motif Hierarchical Stochastic Blockmodels

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Repeated Motif Hierarchical Stochastic Blockmodels

Download to your calendar using vCal

If you have a question about this talk, please contact INI IT .

SNAW01 - Graph limits and statistics

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, http://arxiv.org/abs/1503.02115), 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, http://arxiv.org/abs/1410.8826) .
Related Links

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9025.35576923 kWh Philomathia Forum 2017 Clinical Neurosciences Seminars

Other talks

Title to be confirmed Title to be confirmed Group Work Non-stationarity in structural dynamics, challenges and implications for modelling and structural health monitoring Ensemble inequivalence for systems with long-range interactions Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity