On the maximum of random assignment process
Mikhail Lifshits, Arman Tadevosian

TL;DR
This paper analyzes the expected maximum value in a random assignment process based on a square matrix with independent entries, expressing the result through the matrix's distribution quantile function.
Contribution
It provides a novel characterization of the maximum's expectation in random assignment processes using distribution quantiles under mild assumptions.
Findings
Expectation of maximum is expressed via quantile function.
Results apply to matrices with independent entries.
Provides insights into the behavior of random assignment maxima.
Abstract
We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its quantile function.
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
TopicsRandom Matrices and Applications · Markov Chains and Monte Carlo Methods · Matrix Theory and Algorithms
