No article text was recorded for this version.
information-theoretic matching limits
Version 1 of 138 papers76 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
- Blog: Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator
- Blog: Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment
- Blog: Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
- Blog: Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation
- Blog: On Graph Matching Using Generalized Seed Side-Information
- Blog: Typicality Matching for Pairs of Correlated Graphs
- Blog: Partial Recovery in the Graph Alignment Problem
- Blog: Alignment strength and correlation for graphs
- Blog: Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment
- Blog: Impossibility of Partial Recovery in the Graph Alignment Problem
- Blog: Matching Graphs with Community Structure: A Concentration of Measure Approach
- Blog: Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment
- Blog: Asymmetric tree correlation testing for graph alignment
- Blog: Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
- Blog: Sharp threshold for alignment of graph databases with Gaussian weights
- Blog: Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks
- Blog: Seeded Graph Matching via Large Neighborhood Statistics
- Blog: On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
- Blog: Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
- Blog: Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
- Blog: A Concentration of Measure Approach to Correlated Graph Matching
- Blog: Efficient Graph Matching for Correlated Stochastic Block Models
- Blog: Attributed Network Alignment: Statistical Limits and Efficient Algorithm
- Blog: Graph Matching with Partially-Correct Seeds
- Blog: Random Graph Matching in Geometric Models: the Case of Complete Graphs
- Blog: Database Alignment with Gaussian Features
- Blog: Multiplex graph matching matched filters
- Blog: Fundamental Limits of Database Alignment
- Blog: Correlation Detection in Trees for Planted Graph Alignment
- Blog: Aligning random graphs with a sub-tree similarity message-passing algorithm
- Blog: Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment
- Blog: Near-Optimal Joint Object Matching via Convex Relaxation
- Blog: Matching Correlated Inhomogeneous Random Graphs using the $k$-core Estimator
- Blog: Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
- Blog: Attributed Graph Alignment
- Blog: Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation Extended Abstract
- Blog: From tree matching to sparse graph alignment
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_information_theoretic_matching_limits_478b2fc1,
title = {information-theoretic matching limits},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/information-theoretic-matching-limits/rdr_478b2fc1feaf48819a2516cabecc29d7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_information_theoretic_matching_limits_478b2fc1_v1,
title = {information-theoretic matching limits},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/information-theoretic-matching-limits/rdr_478b2fc1feaf48819a2516cabecc29d7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}