–
Coffee and Check In
–
Opening Remarks
–
Random Cluster Model on Regular Graphs
Péter Csikvári (Eötvös Loránd University)
–
Analytic Approach to Guasirandomness
Dan Král (Masaryk University)
–
Coffee Break
–
Sparse Random Graphs: Interplay of Local and Global Structure
Mihyun Kang (Technische Universität Graz, Austria)
–
Response of Graphs to Competing Constraints
Charles Radin (University of Texas)
–
Lunch
–
Mean-field approximations for high-dimensional Bayesian Regression
Subhabrata Sen (Harvard University)
–
A Large Deviation Principle for Block Models
Julia Gaudio (Northwestern University)
–
Coffee Break
–
Higher-Order Graphon Theory: Fluctuations, Inference, and Degeneracies
Bhaswar Bhattacharya (University of Pennsylvania)
–
Reception
–
Coffee and Check In
–
Common Graphs with Arbitrary Chromatic Number
Jan Volec (Czech Technical University in Prague)
–
A Deterministic Theory of Low Rank Matrix Completion
Sourav Chatterjee (Stanford University)
–
Break
–
Higher Order Fluctuations in Dense Random Graph Models
Adrian Roellin (National University of Singapore)
–
Symmetry and Convergence
Peter Orbanz (University College London)
–
Lunch
–
Efficiently Exploiting Model Structure in Network Causal Inference with and without Knowledge of the Network
Christina Lee Yu (Cornell University)
–
Sparse Random Graphs with Many Triangles
Suman Chakraborty (Leiden University)
–
Break
–
On the Second Kahn-Kalai Conjecture
Ilias Zadik (Massachusetts Institute of Technology (MIT)
–
Coffee and Check In
–
The Degree-Restricted Random Process Is Far From Uniform
Lutz Warnke (UC San Diego)
–
Recent Developments on Graph Norms
Joonkyung Lee (Hanyang University)
–
Break
–
A Theory for Graph Embedding Methods and Some Limit Theorems
Morgane Austern (Harvard University)
–
Higher-order Fluctuations in Dense Random Graph Models
Gursharn Kaur (University of Virgina)
–
Lunch
–
Hike
–
Coffee and Check In
–
Graphon-valued Stochastic Processes
Siva Athreya (Indian Statistical Insitute)
–
Graphon Limit and Large Independent Sets in Uniform Random Cographs
Valentin Féray (Université de Lorraine)
–
Break
–
Motif Counting via Subgraph Sampling
Sumit Mukherjee (Columbia University)
–
Vertexons and Embedded Graphon Mean Field Games
Peter Caines (McGill University)
–
Lunch
–
Graphon Games
Francesca Parise (Cornell University)
–
Longitudinal Network Models, Log-Linear Multigraph Models, and Implications to Estimation and Testing Model Fit
Sonja Petrović (Illinois Institute of Technology)
–
Coffee and Check In
–
Large Deviation Principle for the Norm of the Adjacency Matrix and the Laplacian Matrix of Inhomogeneous Erd\H{o}s-R\'enyi Random Graphs
Frank den Hollander (Leiden University)
–
Stochastic Processes on Sparse Graphs: Hydrodynamic Limits and Markov Approximations
Kavita Ramanan (Brown University)
–
Break
–
Long Range Dependence in Evolving Networks
Shankar Bhamidi (University of North Carolina, Chapel Hill)
–
Survey on Sparse Graph Limits + A Toy Example
Mei Yin (University of Denver)
–
Lunch
–
Machine Learning on Large-Scale Graphs
Luana Ruiz (University of Pennsylvania)
–
Optimality of Variational Inference for Stochastic Block Model
Olga Klopp (ESSEC Business School)