Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Semerjian, Guilhem"'
Autor:
Muratori, Andrea, Semerjian, Guilhem
Publikováno v:
J. Stat. Mech. 113405 (2024)
The correlated Erd\"os-R\'enyi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $\lambda$ and their correlation coefficient $s$. It can be used as a benchmark for the graph alignmen
Externí odkaz:
http://arxiv.org/abs/2405.08421
Autor:
Semerjian, Guilhem
Publikováno v:
J. Stat. Phys. 191, 139 (2024)
We consider the additive version of the matrix denoising problem, where a random symmetric matrix $S$ of size $n$ has to be inferred from the observation of $Y=S+Z$, with $Z$ an independent random matrix modeling a noise. For prior distributions of $
Externí odkaz:
http://arxiv.org/abs/2402.16719
Publikováno v:
Annals of Applied Probability 2024, Vol. 34, No. 4, 3701-3734
In this paper we address the problem of testing whether two observed trees $(t,t')$ are sampled either independently or from a joint distribution under which they are correlated. This problem, which we refer to as correlation detection in trees, play
Externí odkaz:
http://arxiv.org/abs/2209.13723
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, focusing on the random constraint satisfaction problems for which it provide
Externí odkaz:
http://arxiv.org/abs/2209.11499
Publikováno v:
J. Stat. Mech. (2022) 063401
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a polynomial tim
Externí odkaz:
http://arxiv.org/abs/2112.13079
Autor:
Budzynski, Louise, Semerjian, Guilhem
Publikováno v:
J. Stat. Mech. (2020) 103406
We investigate the clustering transition undergone by an exemplary random constraint satisfaction problem, the bicoloring of $k$-uniform random hypergraphs, when its solutions are weighted non-uniformly, with a soft interaction between variables belo
Externí odkaz:
http://arxiv.org/abs/2007.10303
Publikováno v:
Phys. Rev. E 102, 022304 (2020)
We consider the statistical inference problem of recovering an unknown perfect matching, hidden in a weighted random graph, by exploiting the information arising from the use of two different distributions for the weights on the edges inside and outs
Externí odkaz:
http://arxiv.org/abs/2005.11274
Autor:
Budzynski, Louise, Semerjian, Guilhem
Publikováno v:
Journal of Statistical Physics, 181(5) (2020), 1490-1522
Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an information the
Externí odkaz:
http://arxiv.org/abs/1911.09377
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
J. Stat. Mech. (2019) 023302
The typical complexity of Constraint Satisfaction Problems (CSPs) can be investigated by means of random ensembles of instances. The latter exhibit many threshold phenomena besides their satisfiability phase transition, in particular a clustering or
Externí odkaz:
http://arxiv.org/abs/1811.01680