论网络模型的可交换性

Journal of Algebraic Statistics Pub Date : 2017-09-12 DOI:10.18409/JAS.V10I1.73

S. Lauritzen, A. Rinaldo, Kayvan Sadeghi

{"title":"论网络模型的可交换性","authors":"S. Lauritzen, A. Rinaldo, Kayvan Sadeghi","doi":"10.18409/JAS.V10I1.73","DOIUrl":null,"url":null,"abstract":"We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size. ","PeriodicalId":41066,"journal":{"name":"Journal of Algebraic Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On Exchangeability in Network Models\",\"authors\":\"S. Lauritzen, A. Rinaldo, Kayvan Sadeghi\",\"doi\":\"10.18409/JAS.V10I1.73\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size. \",\"PeriodicalId\":41066,\"journal\":{\"name\":\"Journal of Algebraic Statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18409/JAS.V10I1.73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18409/JAS.V10I1.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

基于几何和图论的概念，我们利用初等自变量导出了有限图和无限图上可交换分布的表示定理。我们的结果阐明了有限可交换的统计网络模型和在不断增加的图上定义一致概率分布序列的模型之间的一些关键差异及其含义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Exchangeability in Network Models

We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their implications, between statistical network models that are finitely exchangeable and models that define a consistent sequence of probability distributions on graphs of increasing size.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Algebraic Statistics STATISTICS & PROBABILITY-

自引率

0.00%

发文量