Belief propagation for minimum weight many-to-one matchings in the random complete graph

DOI10.1214/EJP.v19-3491zbMath1321.60013arXiv1405.1292OpenAlexW2010258707MaRDI QIDQ2514304

Mustafa Khandwawala

Publication date: 3 February 2015

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.1292

zbMATH Keywords

random graphlocal weak convergenceobjective methodbelief propagationmany-to-one matching

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs

This page was built for publication: Belief propagation for minimum weight many-to-one matchings in the random complete graph