Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality

被引:0
作者
Ryan DeMuse
Danielle Larcomb
Mei Yin
机构
[1] University of Denver,Department of Mathematics
来源
Journal of Statistical Physics | 2018年 / 171卷
关键词
Exponential random graphs; Legendre duality; Phase transitions; Near degeneracy and universality; 05C80; 82B26;
D O I
暂无
中图分类号
学科分类号
摘要
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is especially problematic. We extend the existing exponential framework by proposing a generic common distribution for the edge weights. Minimal assumptions are placed on the distribution, that is, it is non-degenerate and supported on the unit interval. By doing so, we recognize the essential properties associated with near-degeneracy and universality in edge-weighted exponential random graphs.
引用
收藏
页码:127 / 144
页数:17
相关论文
共 66 条
[1]  
Frank O(1986)Markov graphs J. Am. Stat. Assoc. 81 832-842
[2]  
Strauss D(2003)The structure and function of complex networks SIAM Rev. 45 167-256
[3]  
Newman M(1975)Statistical analysis of non-lattice data J. R. Stat. Soc. Ser. D. Stat. 24 179-195
[4]  
Besag J(2006)New specifications for exponential random graph models Sociol. Methodol. 36 99-153
[5]  
Snijders TAB(2009)On the geometry of discrete exponential families with application to exponential random graph models Electron. J. Stat. 3 446-484
[6]  
Pattison P(2010)Introduction to papers on the modeling and analysis of network data Ann. Appl. Stat. 4 1-4
[7]  
Robins GL(2010)Introduction to papers on the modeling and analysis of network data II Ann. Appl. Stat. 4 533-534
[8]  
Handcock M(2011)The large deviation principle for the Erdős-Rényi random graph Eur. J. Comb. 32 1000-1017
[9]  
Rinaldo A(2013)Estimating and understanding exponential random graph models Ann. Stat. 41 2428-2461
[10]  
Fienberg SE(2013)Phase transitions in exponential random graphs Ann. Appl. Probab. 23 2458-2471