Extrema of a multinomial assignment process

DOI10.1017/jpr.2023.26arXiv2209.05028MaRDI QIDQ6198968

Gilles Mordant, Mikhail Lifshits

Publication date: 23 February 2024

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

minimamultinomial distributionexpected maximarandom assignment process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial optimization (90C27) Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• Asymptotics in the random assignment problem
• A connection between supermodular ordering and positive/negative association.
• A proof of Parisi's conjecture on the random assignment problem
• Negative association of random variables, with applications
• Typical values of extremal-weight combinatorial structures with independent symmetric weights
• 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
• Constructive bounds and exact expectations for the random assignment problem
• Random Assignment with Integer Costs
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

This page was built for publication: Extrema of a multinomial assignment process