A Conjecture on random bipartite matching
Giorgio Parisi
TL;DR
This paper proposes a conjecture regarding the expected optimal length in a bipartite matching problem where edge lengths are independent exponential random variables.
Contribution
It introduces a new conjecture on the average optimal matching length in a specific probabilistic bipartite matching setting.
Findings
Conjecture on average optimal length for exponential bipartite matching.
Insight into probabilistic properties of bipartite matchings.
Foundation for future theoretical validation or proof.
Abstract
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research