OpenAlex
The planted k-factor problem
Work
Year: 2021
Type: article
Abstract: We consider the problem of recovering an unknown k -factor, hidden in a weighted random graph. For k = 1 this is the planted matching problem, while the k = 2 case is closely related to the planted t... more
Source: Journal of Physics A Mathematical and Theoretical
Authors Gabriele Sicuro, Lenka Zdeborová
Institutions King's College London, École Polytechnique Fédérale de Lausanne
Cites: 27
Cited by: 5
Related to: 10
FWCI: 0.644
Citation percentile (by year/subfield): 99.98
Topic: Statistical Methods and Inference
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Funders Agence Nationale de la Recherche, H2020 European Research Council
Grant IDS ANR-17-CE23-0023-01 PAIL, CoSP N. 823748