SINM Symposium Schedule: 8:45 AM - 4:30 PM
| 8:45 - 9:05 | — | OPENING REMARKS |
| 9:05 - 9:40 |
Johan Ugander Cornell |
Graph cluster randomization: design and analysis for experiments in networks |
| 9:40 - 10:05 |
Nino Antulov-Fantulin Ruđer Bošković Institute |
Statistical inference of epidemic sources in bipartite temporal networks |
| 10:05 - 10:30 |
Dane Taylor SAMSI, UNC |
Causal Network Inference by Optimal Causation Entropy |
| 10:30 - 11:00 | — | COFFEE |
| 11:00 - 11:35 |
Simon Lunagomez Harvard |
Valid Inference from Non-Ignorable Network Sampling Designs |
| 11:35 - 12:00 |
Jeffrey Schmidt Binghamton University |
Uncovering the underlying dynamics of real world temporal network data using Generative Network Automata |
| 12:00 - 12:25 |
Forough Arabshahi UC Irvine |
Modeling and Predicting Dynamic Social Interactions via Conditional Latent Random Fields |
| 12:25 - 1:00 |
David Choi Carnegie Mellon |
Consistency of Co-clustering exchangeable graph data |
| 1:00 - 2:00 | — | LUNCH |
| 2:00 - 2:35 |
Tiago Peixoto Bremen |
Hierarchical Block Structures and High-Resolution Model Selection in Large Networks |
| 2:35 - 3:00 |
Pan Zhang Santa Fe Institute |
Scalable detection of statistically significant communities and hierarchies: message-passing for modularity |
| 3:00 - 3:25 |
Tatsuro Kawamoto Tokyo Inst. of Technology |
The map equation and the resolution limit in community detection |
| 3:25 - 3:50 |
Amiyaal Ilany NIMBioS |
How do animals choose their allies? Stochastic actor-based models reveal long term social network dynamics in a wild mammal population |
| 3:50 - 4:00 | — | CLOSING REMARKS |
| 4:00 - 4:30 | — | COFFEE |