2 papers
math.PR2026
Optimal matching under size priority
Nathanaël Enriquez, Mike Liu, Laurent Ménard +1
Past studies on the local limit of maximal weight matchings in edge-weighted large random graphs rely fundamentally on the assumption that the weights are atomless, which ensures t…
math.PR2024
Optimal Unimodular Matching
Nathanaël Enriquez, Mike Liu, Laurent Ménard +1
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings…