IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v24y2022i4d10.1007_s11009-022-09973-y.html
   My bibliography  Save this article

Markovian Online Matching Algorithms on Large Bipartite Random Graphs

Author

Listed:
  • Mohamed Habib Aliou Diallo Aoudi

    (Alliance Sorbonne Universités, LMAC, Université de Technologie de Compiègne)

  • Pascal Moyal

    (Université de Lorraine and INRIA / PASTA)

  • Vincent Robin

    (Alliance Sorbonne Universités, LMAC, Université de Technologie de Compiègne)

Abstract

In this paper, we present an approximation of the matching coverage on large bipartite graphs, for local online matching algorithms based on the sole knowledge of the remaining degree of the nodes of the graph at hand. This approximation is obtained by applying the Differential Equation Method to a measure-valued process representing an alternative construction, in which the matching and the graph are constructed simultaneously, by a uniform pairing leading to a realization of the bipartite Configuration Model. The latter auxiliary construction is shown to be equivalent in distribution to the original one. It allows to drastically reduce the complexity of the problem, in that the resulting matching coverage can be written as a simple function of the final value of the process, and in turn, approximated by a simple function of the solution of a system of ODE’s. By way of simulations, we illustrate the accuracy of our estimate, and then compare the performance of an algorithm based on the minimal residual degree of the nodes, to the classical greedy matching.

Suggested Citation

  • Mohamed Habib Aliou Diallo Aoudi & Pascal Moyal & Vincent Robin, 2022. "Markovian Online Matching Algorithms on Large Bipartite Random Graphs," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 3195-3225, December.
    • Handle: RePEc:spr:metcap:v:24:y:2022:i:4:d:10.1007_s11009-022-09973-y
    DOI: 10.1007/s11009-022-09973-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-022-09973-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-022-09973-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bermolen, Paola & Jonckheere, Matthieu & Moyal, Pascal, 2017. "The jamming constant of uniform random graphs," Stochastic Processes and their Applications, Elsevier, vol. 127(7), pages 2138-2178.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jonckheere, Matthieu & Sáenz, Manuel, 2021. "Asymptotic optimality of degree-greedy discovering of independent sets in Configuration Model graphs," Stochastic Processes and their Applications, Elsevier, vol. 131(C), pages 122-150.

    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:spr:metcap:v:24:y:2022:i:4:d:10.1007_s11009-022-09973-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.