On the finite size corrections to some random matching problems
Disordered Systems and Neural Networks
2009-11-07 v1
Abstract
We get back to the computation of the leading finite size corrections to some random link matching problems, first adressed by Mezard and Parisi [J. Physique 48 (1987) 1451-1459]. In the so-called bipartite case, their result is in contradiction with subsequent works. We show that they made some mistakes, and correcting them, we get the expected result. In the non bipartite case, we agree with their result but push the analytical treatment further
Cite
@article{arxiv.cond-mat/0204595,
title = {On the finite size corrections to some random matching problems},
author = {G. Parisi and M. Ratieville},
journal= {arXiv preprint arXiv:cond-mat/0204595},
year = {2009}
}
Comments
22 pages, 3 figures