{"title":"双星模型的GHS和其他相关不等式","authors":"A. Bianchi, Francesca Collet, Elena Magnanini","doi":"10.30757/ALEA.v19-64","DOIUrl":null,"url":null,"abstract":". We consider the two-star model, a family of exponential random graphs indexed by two real parameters, h and α , that rule respectively the total number of edges and the mutual dependence between them. Borrowing tools from statistical mechanics, we study different classes of correlation inequalities for edges, that naturally emerge while taking the partial derivatives of the (finite size) free energy. In particular, if α, h ≥ 0 , we derive first and second order correlation inequalities and then prove the so-called GHS inequality. As a consequence, under the above conditions on the parameters, the average edge density turns out to be an increasing and concave function of the parameter h , at any fixed size of the graph. Some of our results can be extended to more general classes of exponential random graphs.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The GHS and other correlation inequalities for the two-star model\",\"authors\":\"A. Bianchi, Francesca Collet, Elena Magnanini\",\"doi\":\"10.30757/ALEA.v19-64\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". We consider the two-star model, a family of exponential random graphs indexed by two real parameters, h and α , that rule respectively the total number of edges and the mutual dependence between them. Borrowing tools from statistical mechanics, we study different classes of correlation inequalities for edges, that naturally emerge while taking the partial derivatives of the (finite size) free energy. In particular, if α, h ≥ 0 , we derive first and second order correlation inequalities and then prove the so-called GHS inequality. As a consequence, under the above conditions on the parameters, the average edge density turns out to be an increasing and concave function of the parameter h , at any fixed size of the graph. Some of our results can be extended to more general classes of exponential random graphs.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.30757/ALEA.v19-64\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.30757/ALEA.v19-64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The GHS and other correlation inequalities for the two-star model
. We consider the two-star model, a family of exponential random graphs indexed by two real parameters, h and α , that rule respectively the total number of edges and the mutual dependence between them. Borrowing tools from statistical mechanics, we study different classes of correlation inequalities for edges, that naturally emerge while taking the partial derivatives of the (finite size) free energy. In particular, if α, h ≥ 0 , we derive first and second order correlation inequalities and then prove the so-called GHS inequality. As a consequence, under the above conditions on the parameters, the average edge density turns out to be an increasing and concave function of the parameter h , at any fixed size of the graph. Some of our results can be extended to more general classes of exponential random graphs.