research
∙
09/27/2022
Statistical limits of correlation detection in trees
In this paper we address the problem of testing whether two observed tre...
share
research
∙
09/23/2022
The cavity method: from exact solutions to algorithms
The goal of this chapter is to review the main ideas that underlie the c...
research
∙
12/24/2021
Aligning random graphs with a sub-tree similarity message-passing algorithm
The problem of aligning Erdös-Rényi random graphs is a noisy, average-ca...
research
∙
07/20/2020
Biased measures for random Constraint Satisfaction Problems: larger interaction range and asymptotic expansion
We investigate the clustering transition undergone by an exemplary rando...
research
∙
05/22/2020
Recovery thresholds in the sparse planted matching problem
We consider the statistical inference problem of recovering an unknown p...
research
∙
11/21/2019
The asymptotics of the clustering transition for random constraint satisfaction problems
Random Constraint Satisfaction Problems exhibit several phase transition...
research
∙
11/05/2018
Biased landscapes for random Constraint Satisfaction Problems
The typical complexity of Constraint Satisfaction Problems (CSPs) can be...
research
∙
06/28/2018