31 citations · 70 across the 6 of their papers we have counts for
12 papers
Planted matching problems on random hypergraphs
Urte Adomaityte, Anshul Toshniwal, Gabriele Sicuro +1
We consider the problem of inferring a matching hidden in a weighted random -hypergraph. We assume that the hyperedges' weights are random and distributed according to two diffe…
Criticality and conformality in the random dimer model
Sergio Caracciolo, Riccardo Fabbricatore, Marco Gherardi +3
In critical systems, the effect of a localized perturbation affects points that are arbitrarily far from the perturbation location. In this paper, we study the effect of localized…
The planted -factor problem
Gabriele Sicuro, Lenka Zdeborová
We consider the problem of recovering an unknown -factor, hidden in a weighted random graph. For this is the planted matching problem, while the case is closely rela…
Recovery thresholds in the sparse planted matching problem
Guilhem Semerjian, Gabriele Sicuro, Lenka Zdeborová
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 tw…
Random-link matching problems on random regular graphs
Giorgio Parisi, Gianmarco Perrupato, Gabriele Sicuro
We study the random-link matching problem on random regular graphs, alongside with two relaxed versions of the problem, namely the fractional matching and the so-called "loopy" fra…
Fluctuations in the random-link matching problem
Enrico M. Malatesta, Giorgio Parisi, Gabriele Sicuro
Using the replica approach and the cavity method, we study the fluctuations of the optimal cost in the random-link matching problem. By means of replica arguments, we derive the ex…