Correlation detection in trees for planted graph alignment

DOI10.1214/23-AAP2020zbMATH Open1545.05199MaRDI QIDQ6591586

Laurent Massoulié, Luca Ganassali, Marc Lelarge

Publication date: 22 August 2024

Published in: The Annals of Applied Probability (Search for Journal in Brave)

zbMATH Keywords

hypothesis testinggraph matchinggraph alignmentinference in random graphs

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Belief propagation, robust reconstruction and optimal recovery of block models
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Efficient random graph matching via degree profiles
• Spectral redemption in clustering sparse networks
• The automorphism group of random graphs with a given number of edges
• Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
• Aligning random graphs with a sub-tree similarity message-passing algorithm
• Settling the Sharp Reconstruction Thresholds of Random Graph Matching
• Testing correlation of unlabeled random graphs
• Matching recovery threshold for correlated random graphs
• Partial Recovery in the Graph Alignment Problem

This page was built for publication: Correlation detection in trees for planted graph alignment

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