Graph Limits, Nonparametric Models, and Estimation

Program

Graph Limits and Processes on Networks: From Epidemics to Misinformation

Location

All events take place in the Calvin Lab auditorium.

Date

Monday, Sept. 26 – Friday, Sept. 30, 2022

Back to calendar

8:30 – 8:55 a.m.

Coffee and Check In

8:55 – 9 a.m.

Opening Remarks

9 – 9:45 a.m.

Random Cluster Model on Regular Graphs

Péter Csikvári (Eötvös Loránd University)

9:45 – 10:30 a.m.

Analytic Approach to Guasirandomness

Dan Král (Masaryk University)

10:30 – 11 a.m.

Coffee Break

11 – 11:45 a.m.

Sparse Random Graphs: Interplay of Local and Global Structure

Mihyun Kang (Technische Universität Graz, Austria)

11:45 a.m. – 12:30 p.m.

Response of Graphs to Competing Constraints

Charles Radin (University of Texas)

12:30 – 2 p.m.

Lunch

2 – 2:45 p.m.

Mean-field approximations for high-dimensional Bayesian Regression

Subhabrata Sen (Harvard University)

2:45 – 3:30 p.m.

A Large Deviation Principle for Block Models

Julia Gaudio (Northwestern University)

3:30 – 4 p.m.

Coffee Break

4 – 4:45 p.m.

Higher-Order Graphon Theory: Fluctuations, Inference, and Degeneracies

Bhaswar Bhattacharya (University of Pennsylvania)

4:45 – 5:45 p.m.

Reception

8:30 – 9 a.m.

Coffee and Check In

9 – 9:45 a.m.

Common Graphs with Arbitrary Chromatic Number

Jan Volec (Czech Technical University in Prague)

9:45 – 10:30 a.m.

A Deterministic Theory of Low Rank Matrix Completion

Sourav Chatterjee (Stanford University)

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

Higher Order Fluctuations in Dense Random Graph Models

Adrian Roellin (National University of Singapore)

11:45 a.m. – 12:30 p.m.

Symmetry and Convergence

Peter Orbanz (University College London)

12:30 – 2 p.m.

Lunch

2 – 2:45 p.m.

Efficiently Exploiting Model Structure in Network Causal Inference with and without Knowledge of the Network

Christina Lee Yu (Cornell University)

2:45 – 3:30 p.m.

Sparse Random Graphs with Many Triangles

Suman Chakraborty (Leiden University)

3:30 – 4 p.m.

Break

4 – 4:45 p.m.

On the Second Kahn-Kalai Conjecture

Ilias Zadik (Massachusetts Institute of Technology (MIT)

8:30 – 9 a.m.

Coffee and Check In

9 – 9:45 a.m.

The Degree-Restricted Random Process Is Far From Uniform

Lutz Warnke (UC San Diego)

9:45 – 10:30 a.m.

Recent Developments on Graph Norms

Joonkyung Lee (Hanyang University)

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

A Theory for Graph Embedding Methods and Some Limit Theorems

Morgane Austern (Harvard University)

11:45 a.m. – 12:30 p.m.

Higher-order Fluctuations in Dense Random Graph Models

Gursharn Kaur (University of Virgina)

12:30 – 2 p.m.

Lunch

2 – 4 p.m.

Hike

8:30 – 9 a.m.

Coffee and Check In

9 – 9:45 a.m.

Graphon-valued Stochastic Processes

Siva Athreya (Indian Statistical Insitute)

9:45 – 10:30 a.m.

Graphon Limit and Large Independent Sets in Uniform Random Cographs

Valentin Féray (Université de Lorraine)

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

Motif Counting via Subgraph Sampling

Sumit Mukherjee (Columbia University)

11:45 a.m. – 12:30 p.m.

Vertexons and Embedded Graphon Mean Field Games

Peter Caines (McGill University)

12:30 – 2 p.m.

Lunch

2 – 2:45 p.m.

Graphon Games

Francesca Parise (Cornell University)

2:45 – 3:30 p.m.

Longitudinal Network Models, Log-Linear Multigraph Models, and Implications to Estimation and Testing Model Fit

Sonja Petrović (Illinois Institute of Technology)

8:30 – 9 a.m.

Coffee and Check In

9 – 9:45 a.m.

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)

9:45 – 10:30 a.m.

Stochastic Processes on Sparse Graphs: Hydrodynamic Limits and Markov Approximations

Kavita Ramanan (Brown University)

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

Long Range Dependence in Evolving Networks

Shankar Bhamidi (University of North Carolina, Chapel Hill)

11:45 a.m. – 12:30 p.m.

Survey on Sparse Graph Limits + A Toy Example

Mei Yin (University of Denver)

12:30 – 2 p.m.

Lunch

2 – 2:45 p.m.

Machine Learning on Large-Scale Graphs

Luana Ruiz (University of Pennsylvania)

2:45 – 3:30 p.m.

Optimality of Variational Inference for Stochastic Block Model

Olga Klopp (ESSEC Business School)