Abstract
We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wästlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the
Citation
Mustafa Khandwawala. Rajesh Sundaresan. "Belief propagation for optimal edge cover in the random complete graph." Ann. Appl. Probab. 24 (6) 2414 - 2454, December 2014. https://doi.org/10.1214/13-AAP981
Information