On the Maximum of a Special Random Assignment Process

DOI10.1137/S0040585X97T991192MaRDI QIDQ5883338

A. A. Tadevosian, Mikhail 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

asymptotic behaviorbipartite graphmaximizationassignment process

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• Maxima and near-maxima of a Gaussian random assignment field
• On the maximum of random assignment process
• The ?(2) limit in the random assignment problem
• Outage Exponent: A Unified Performance Metric for Parallel Fading Channels
• On the expected value of the minimum assignment
• Constructive bounds and exact expectations for the random assignment problem
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

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