Extrema of a multinomial assignment process
From MaRDI portal
Abstract: We study the asymptotic behavior of the expectation of the maxima and minima of random assignment process generated by a large matrix with multinomial entries. A variety of results is obtained for different sparsity regimes.
Recommendations
- On the maximum of random assignment process
- On the Maximum of a Special Random Assignment Process
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- On the expected number of assignments in reduced matrices for the linear assignment problem
- On the expected value of the minimum assignment
Cites work
- A connection between supermodular ordering and positive/negative association.
- A proof of Parisi's conjecture on the random assignment problem
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- Asymptotics in the random assignment problem
- Constructive bounds and exact expectations for the random assignment problem
- scientific article; zbMATH DE number 3216216 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- Limit theorems for associated fields and related systems.
- Maxima and near-maxima of a Gaussian random assignment field
- Negative association of random variables, with applications
- On the maximum of random assignment process
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- Random Assignment with Integer Costs
- The (2) limit in the random assignment problem
- Typical values of extremal-weight combinatorial structures with independent symmetric weights
This page was built for publication: Extrema of a multinomial assignment process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198968)
