A rigorous proof of the cavity method for counting matchings
<|reference_start|>A rigorous proof of the cavity method for counting matchings: In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important heuristic developed by statistical physicists that has lead to the development of faster distributed algorithms for problems in various combinatorial optimization problems. The validity of the approach has been supported mostly by numerical simulations. In this paper we prove the validity of cavity method for the problem of counting matchings using rigorous techniques. We hope that these rigorous approaches will finally help us establish the validity of the cavity method in general.<|reference_end|>
@article{bayati2006a,
    title={A rigorous proof of the cavity method for counting matchings},
    author={Mohsen Bayati, Chandra Nair},
    journal={arXiv preprint arXiv:cond-mat/0607290},
    year={2006},
    archivePrefix={arXiv},
    eprint={cond-mat/0607290},
    primaryClass={cond-mat.dis-nn cond-mat.stat-mech cs.CC}
}