Statistical limits of correlation detection in trees

DOI10.1214/23-aap2048zbMATH Open1548.05297MaRDI QIDQ6616873

Guilhem Semerjian, Luca Ganassali, Laurent Massoulié

Publication date: 9 October 2024

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

zbMATH Keywords

combinatoricshypothesis testingrandom graphsstatistical inference

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A metric for rooted trees with unlabeled vertices based on nested parentheses
• The number of trees
• Edit distance between unlabeled ordered trees
• Weighted Derangements and the Linearization Coefficients of Orthogonal Sheffer Polynomials
• Aligning random graphs with a sub-tree similarity message-passing algorithm
• Testing correlation of unlabeled random graphs
• Partial Recovery in the Graph Alignment Problem
• Random graph matching at Otter's threshold via counting chandeliers
• Detection threshold for correlated Erdős-Rényi graphs via densest subgraph

This page was built for publication: Statistical limits of correlation detection in trees

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