Maximum matching on random graphs

Simple item page
dc.creatorZhou, Haijun
dc.creatorOu-Yang, Zhong-can
dc.date2003-09-15
dc.date.accessioned2026-07-07T02:53:26Z
dc.date.available2026-07-07T02:53:26Z
dc.descriptionThe maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \mth{c} is larger than \mth{2.7183}, groups of max-matching patterns which differ greatly from each other {\em gradually} emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on this {\em continuous} glassy phase transition and the absence of such a glassy phase in the related minimum vertex covering problem.
dc.description7 pages with 2 eps figures included. Use EPL style. Submitted to Europhysics Letters
dc.identifierhttps://arxiv.org/abs/cond-mat/0309348
dc.identifierhttp://arxiv.org/abs/cond-mat/0309348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/22217
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleMaximum matching on random graphs
dc.typetext

Files

Collections

arXiv