博士生讨论班2025[13]
作者:
时间:2025-05-07
阅读量:59次
  • 演讲人: 王啸林
  • 时间:2025年5月13日
  • 地点:浙江大学紫金港校区行政楼1417报告厅

报告文章:Conditional central limit theorems for exponential random graphs

摘要:In this paper, we study the Exponential Random Graph Model (ERGM) conditioning on the number of edges. 

In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the number of two stars. This generalizes the corresponding result in the literature for the Erd\H{o}s--R\'enyi random graph. To prove our main result, we develop a new conditional CLT via exchangeable pairs based on the ideas of Dey and Terlov. Our key technical contributions in the application to ERGM include establishing a linearity condition for an exchangeable pair involving two star counts, a local CLT for edge counts, as well as new higher-order concentration inequalities. Our approach also works for general subgraph counts, and we give a conjectured form of their conditional CLT.