activity
20022025
most citedGibbs States and the Set of Solutions of Random Constraint Satisfaction Problems

553 citations · 2.9k across the 47 of their papers we have counts for

collaborators

47 papers

cond-mat.dis-nn2025★ 2 cited

Some observations on the ambivalent role of symmetries in Bayesian inference problems

Guilhem Semerjian

We collect in this note some observations on the role of symmetries in Bayesian inference problems, that can be useful or detrimental depending on the way they act on the signal an…

cond-mat.dis-nn2024★ 1 cited

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs

Andrea Muratori, Guilhem Semerjian

The correlated Erdös-Rényi random graph ensemble is a probability law on pairs of graphs with vertices, parametrized by their average degree and their correlation coefficie…

cond-mat.dis-nn2024★ 10 cited

Matrix denoising: Bayes-optimal estimators via low-degree polynomials

Guilhem Semerjian

We consider the additive version of the matrix denoising problem, where a random symmetric matrix of size has to be inferred from the observation of , with an in…

cond-mat.dis-nn2022

The cavity method: from exact solutions to algorithms

Alfredo Braunstein, Guilhem Semerjian

The goal of this chapter is to review the main ideas that underlie the cavity method for disordered models defined on random graphs, as well as present some of its outcomes, focusi…

math.ST2022★ 10 cited

Statistical limits of correlation detection in trees

Luca Ganassali, Laurent Massoulié, Guilhem Semerjian

In this paper we address the problem of testing whether two observed trees are sampled either independently or from a joint distribution under which they are correlated. T…

cs.IT2021★ 13 cited

Aligning random graphs with a sub-tree similarity message-passing algorithm

Giovanni Piccioli, Guilhem Semerjian, Gabriele Sicuro +1

The problem of aligning Erdös-Rényi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through…