Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
cs.IT, cs.DS, math.IT
Submitted: 2025-04-03
Updated: 2026-11-15
Project page: https://statproofbook.github.io/P/kl-inv.html
Terminology
Sources
- An introduction to Galton-Watson trees and their local limits
- One-Way Matching of Datasets with Low Rank Signals
- Exact alignment recovery for correlated Erd\H{o}s-R'enyi graphs
- A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
- Correlation detection in trees for planted graph alignment
- Statistical limits of correlation detection in trees
- Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound