Joint Alignment from Pairwise Differences with a Noisy Oracle

DOI10.1007/978-3-319-92871-5_5MaRDI QIDQ5881228zbMATH OpenOpenAlexFDO

Authors Charalampos E. Tsourakakis, Michael Mitzenmacher

Publication date 9 March 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph miningjoint alignmentnoisy oraclequery pairsspectrometry imaging

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A tail bound for read-k families of functions
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Concentration of multivariate polynomials and its applications
• Exact and stable recovery of rotations for robust synchronization
• Exact Recovery in the Stochastic Block Model
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Rainbow connection of random regular graphs
• Rainbow connectivity of sparse random graphs

This page was built for publication: Joint Alignment from Pairwise Differences with a Noisy Oracle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881228)