Information Recovery in Shuffled Graphs via Graph Matching

DOI10.1109/TIT.2018.2808999zbMath1395.94422arXiv1605.02315OpenAlexW2963003280WikidataQ130201028 ScholiaQ130201028MaRDI QIDQ5375511

Vince Lyzinski

Publication date: 14 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.02315

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of design theory to circuits and networks (94C30) Measures of information, entropy (94A17)

Related Items (3)

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks ⋮ Unnamed Item ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics

This page was built for publication: Information Recovery in Shuffled Graphs via Graph Matching