Monday, May 27 — 8:30 AM to 5:20 PM, Maple Room of the UVM Davis Center

Organized by Tina Eliassi-Rad, Bailey Fosdick, Dan Larremore, & Aaron Clauset

TimeTypeTitleSpeaker
8:30 WELCOME SINM Organizers
8:40 Invited Random clique covers for graphs with local density and global sparsity Sinead Williamson
9:20 Contributed Community Detection in Strongly Self Looping Weighted Networks Tianshe He
9:40 Contributed Estimating network structure from error-prone data Mark Newman
10:00 COFFEE
10:30 Invited Edge-exchangeable graphs and sparsity Tamara Broderick
11:10 Contributed Testing Node-Level Treatment Effects in Networks Keith Levin
11:30 Contributed Minimal I-MAP MCMC. for Scalable Structure Discovery in Causal DAG Models Raj Agrawal
11:50 Flash Talk Bayesian inference of effective contagion models from population level data Jean-Gabriel Young
12:00 LUNCH
1:30 Invited Choosing to grow a graph Austin Benson
2:10 Contributed Faster MCMC for Gaussian Latent Position Network Models Neil Spencer
2:30 Contributed Configuration models of random hypergraphs and their applications Philip Chodrow
2:50 Flash Talk Quantifying endogenous network statistics in network ensembles Laurence Brandenberger
3:00 COFFEE
3:30 Invited The evolution of decision-making, social cognition, and complex sociality Elizabeth Hobson
4:10 Contributed Identifying significant flow-based communities in undersampled networks Jelena Smiljanic
4:30 Contributed Detectability limits in dynamics networks with link persistency Amir Ghasemian
4:50 Flash Spectral Partitioning of Time-Varying Networks from Nodal Observations Santiago Segarra
5:00 Flash Ensemble of gene regulatory networks consequent to evolutionary processes Chia-Hung Yang
5:10 PANEL Sinead Williamson, Tamara Broderick, Austin Benson, Elizabeth Hobson
5:30 CLOSING SINM Organizers