On the Maximum of a Special Random Assignment Process

DOI10.1137/S0040585X97T991192MaRDI QIDQ5883338zbMATH OpenFDO

Authors A. A. Tadevosian, M. A. Lifshits

Publication date 30 March 2023

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2205.01199

zbMATH Keywords

assignment processasymptotic behaviorbipartite graphmaximization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial probability (60C05)

Recommendations

• On the maximum of random assignment process
• Asymptotics in the random assignment problem
• scientific article; zbMATH DE number 1802784
• Order statistics and the linear assignment problem
• Certain expected values in the random assignment problem

Cites work

• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• Constructive bounds and exact expectations for the random assignment problem
• scientific article; zbMATH DE number 1802784 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Maxima and near-maxima of a Gaussian random assignment field
• On the expected value of the minimum assignment
• On the maximum of random assignment process
• Outage Exponent: A Unified Performance Metric for Parallel Fading Channels
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
• The (2) limit in the random assignment problem

Cited in

(4)

• Maxima and near-maxima of a Gaussian random assignment field
• On the maximum of random assignment process
• Extrema of a multinomial assignment process
• On the maximum of a special random assignment process

This page was built for publication: On the Maximum of a Special Random Assignment Process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883338)