恢复破碎随机矩阵的算法

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-09-18 DOI:10.1137/23m1615784

Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo

{"title":"恢复破碎随机矩阵的算法","authors":"Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo","doi":"10.1137/23m1615784","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2509-2529, September 2024. <br/> Abstract. Given some binary matrix [math], suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, can we recover the unique original orderings and matrix? We present an algorithm that identifies whether there is a unique ordering associated with a set of rows and columns, and outputs either the unique correct orderings for the rows and columns or the full collection of all valid orderings and valid matrices. We show that there is a constant [math] such that the algorithm terminates in [math] time with high probability and in expectation for random [math] binary matrices with i.i.d. entries [math] such that [math] and [math].","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"16 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Algorithm to Recover Shredded Random Matrices\",\"authors\":\"Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo\",\"doi\":\"10.1137/23m1615784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2509-2529, September 2024. <br/> Abstract. Given some binary matrix [math], suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, can we recover the unique original orderings and matrix? We present an algorithm that identifies whether there is a unique ordering associated with a set of rows and columns, and outputs either the unique correct orderings for the rows and columns or the full collection of all valid orderings and valid matrices. We show that there is a constant [math] such that the algorithm terminates in [math] time with high probability and in expectation for random [math] binary matrices with i.i.d. entries [math] such that [math] and [math].\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1615784\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1615784","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

SIAM 离散数学杂志》，第 38 卷第 3 期，第 2509-2529 页，2024 年 9 月。摘要。给定一个二元矩阵[math]，假设我们得到了它的行和列的独立任意排序集合。从这些信息中，我们能否恢复唯一的原始排序和矩阵？我们提出了一种算法，它能识别是否存在与一组行列相关的唯一排序，并输出行列的唯一正确排序或所有有效排序和有效矩阵的完整集合。我们证明，存在一个常数[math]，对于具有 i.i.d. 项[math]的随机[math]二进制矩阵[math]，即[math]和[math]，该算法可以在[math]时间内以高概率和期望值终止。

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

查看原文本刊更多论文

An Algorithm to Recover Shredded Random Matrices

SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2509-2529, September 2024.
Abstract. Given some binary matrix [math], suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, can we recover the unique original orderings and matrix? We present an algorithm that identifies whether there is a unique ordering associated with a set of rows and columns, and outputs either the unique correct orderings for the rows and columns or the full collection of all valid orderings and valid matrices. We show that there is a constant [math] such that the algorithm terminates in [math] time with high probability and in expectation for random [math] binary matrices with i.i.d. entries [math] such that [math] and [math].

求助全文

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

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.