Random-link matching problems on random regular graphs

11 Mar 2020 Parisi Giorgio Perrupato Gianmarco Sicuro Gabriele

We study the random-link matching problem on random regular graphs, alongside with two relaxed versions of the problem, namely the fractional matching and the so-called "loopy" fractional matching. We estimated the asymptotic average optimal cost using the cavity method... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISORDERED SYSTEMS AND NEURAL NETWORKS
  • MATHEMATICAL PHYSICS
  • MATHEMATICAL PHYSICS