Journal
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT
Volume -, Issue -, Pages -Publisher
IOP PUBLISHING LTD
DOI: 10.1088/1742-5468/2006/05/P05003
Keywords
cavity and replica method; message-passing algorithms; random graphs; networks
Categories
Ask authors/readers for more resources
We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdos-Renyi random graphs. Our main new result is the computation of the entropy, i.e. the leading order of the logarithm of the number of solutions, of matchings with a given size. We derive both an algorithm to compute this entropy for an arbitrary graph with a girth that diverges in the large size limit, and an analytic result for the entropy in regular and Erdos-Renyi random graph ensembles.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available