用代数蒙特卡罗算法求解分区邻接矩阵的实现问题

Journal of Algebraic Statistics Pub Date : 2017-08-28 DOI:10.2140/astat.2021.12.115

É. Czabarka, L. Székely, Z. Toroczkai, Shanise Walker

{"title":"用代数蒙特卡罗算法求解分区邻接矩阵的实现问题","authors":"É. Czabarka, L. Székely, Z. Toroczkai, Shanise Walker","doi":"10.2140/astat.2021.12.115","DOIUrl":null,"url":null,"abstract":"The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact Matching Problem, and solve them with an algebraic Monte-Carlo algorithm that runs in polynomial time if the number of partition classes is bounded.","PeriodicalId":41066,"journal":{"name":"Journal of Algebraic Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem\",\"authors\":\"É. Czabarka, L. Székely, Z. Toroczkai, Shanise Walker\",\"doi\":\"10.2140/astat.2021.12.115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact Matching Problem, and solve them with an algebraic Monte-Carlo algorithm that runs in polynomial time if the number of partition classes is bounded.\",\"PeriodicalId\":41066,\"journal\":{\"name\":\"Journal of Algebraic Statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2140/astat.2021.12.115\",\"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.2140/astat.2021.12.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

给定度序列和给定分区邻接矩阵的图形化同时实现是数据驱动网络建模中的一个相关问题。在这里，我们给出了这个问题和精确匹配问题的一般推广，并用一个代数蒙特卡罗算法求解它们，该算法在多项式时间内运行，如果划分类的数量是有界的。

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

查看原文本刊更多论文

An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem

The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact Matching Problem, and solve them with an algebraic Monte-Carlo algorithm that runs in polynomial time if the number of partition classes is bounded.

求助全文

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

来源期刊

Journal of Algebraic Statistics STATISTICS & PROBABILITY-

自引率

0.00%

发文量