IDEAS home Printed from https://ideas.repec.org/p/aiz/louvar/2021008.html
   My bibliography  Save this paper

Maxima and near-maxima of a Gaussian random assignment field

Author

Listed:
  • Mordant, Gilles

    (Université catholique de Louvain, LIDAM/ISBA, Belgium)

  • Segers, Johan

    (Université catholique de Louvain, LIDAM/ISBA, Belgium)

Abstract

The assumption that the elements of the cost matrix in the classical assignment problem are drawn independently from a standard Gaussian distribution motivates the study of a particular Gaussian field indexed by the symmetric permutation group. The correlation structure of the field is determined by the Hamming distance between two permutations. The expectation of the maximum of the field is shown to go to infinity in the same way as if all variables of the field were independent. However, the variance of the maximum is shown to converge to zero at a rate which is slower than under independence, as the variance cannot be smaller than the one of the cost of the average assignment. Still, the convergence to zero of the variance means that the maximum possesses a property known as superconcentration. Finally, the dimension of the set of near-optimal assignments is shown to converge to zero.

Suggested Citation

  • Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," LIDAM Reprints ISBA 2021008, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    • Handle: RePEc:aiz:louvar:2021008
    DOI: https://doi.org/10.1016/j.spl.2021.109087
    Note: In: Statistics & Probability Letters, Vol. 173, June 2021, 109087 (2021)
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lifshits, M.A. & Tadevosian, A.A., 2022. "On the maximum of random assignment process," Statistics & Probability Letters, Elsevier, vol. 187(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aiz:louvar:2021008. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nadja Peiffer (email available below). General contact details of provider: https://edirc.repec.org/data/isuclbe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.