3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.PR2022
On the maximum of a special random assignment process
Mikhail Lifshits, Arman Tadevosian
We consider the asymptotic behavior of the expectation of the maximum for a special assignment process with constant or i.i.d. coefficients. We show how it depends on the coefficie…
math.PR2022
On the maximum of random assignment process
Mikhail Lifshits, Arman Tadevosian
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 underl…
math.PR2021★ 3 cited
Gaussian Assignment Process
Mikhail Lifshits, Arman Tadevosian
We define Gaussian assignment process, determine the asymptotic behavior of its maximum's expectation and suggest an explicit strategy that attains the corresponding asymptotics.