IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v131y2021icp122-150.html
   My bibliography  Save this article

Asymptotic optimality of degree-greedy discovering of independent sets in Configuration Model graphs

Author

Listed:
  • Jonckheere, Matthieu
  • Sáenz, Manuel

Abstract

Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this algorithm to find an independent set of asymptotically optimal size in large sparse random graphs with given degree sequences. In the special case of sparse Erdös–Rényi graphs, our results allow to give a simple proof of the so-called e-phenomenon identified by Karp and Sipser for matchings and to give an alternative characterisation of the asymptotic independence number.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:spapps:v:131:y:2021:i:c:p:122-150
    DOI: 10.1016/j.spa.2020.09.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414920303690
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2020.09.009?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. 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.

    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:eee:spapps:v:131:y:2021:i:c:p:122-150. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.