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

The jamming constant of uniform random graphs

Author

Listed:
  • Bermolen, Paola
  • Jonckheere, Matthieu
  • Moyal, Pascal

Abstract

By constructing jointly a random graph and an associated exploration process, we define the dynamics of a “parking process” on a class of uniform random graphs as a measure-valued Markov process, representing the empirical degree distribution of non-explored nodes. We then establish a functional law of large numbers for this process as the number of vertices grows to infinity, allowing us to assess the jamming constant of the considered random graphs, i.e. the size of the maximal independent set discovered by the exploration algorithm. This technique, which can be applied to any uniform random graph with a given–possibly unbounded–degree distribution, can be seen as a generalization in the space of measures, of the differential equation method introduced by Wormald.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:spapps:v:127:y:2017:i:7:p:2138-2178
    DOI: 10.1016/j.spa.2016.10.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414916301806
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2016.10.005?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. Ferrari, Pablo A. & Fernández, Roberto & Garcia, Nancy L., 2002. "Perfect simulation for interacting point processes, loss networks and Ising models," Stochastic Processes and their Applications, Elsevier, vol. 102(1), pages 63-88, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    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.
    2. 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.

    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. Garcia, Nancy L. & Maric, Nevena, 2006. "Existence and perfect simulation of one-dimensional loss networks," Stochastic Processes and their Applications, Elsevier, vol. 116(12), pages 1920-1931, December.
    2. Lasse Leskelä & Falk Unger, 2012. "Stability of a spatial polling system with greedy myopic service," Annals of Operations Research, Springer, vol. 198(1), pages 165-183, September.
    3. Nancy L. Garcia & Nevena Marić, 2008. "Simulation Study for the Clan of Ancestors in a Perfect Simulation Scheme of a Continuous One-Dimensional Loss Network," Methodology and Computing in Applied Probability, Springer, vol. 10(3), pages 453-469, September.
    4. Robert, Philippe, 2010. "The evolution of a spatial stochastic network," Stochastic Processes and their Applications, Elsevier, vol. 120(7), pages 1342-1363, July.
    5. Gregori, P. & van Lieshout, M. N. M. & Mateu, J., 2004. "Mixture formulae for shot noise weighted point processes," Statistics & Probability Letters, Elsevier, vol. 67(4), pages 311-320, May.
    6. van Lieshout, M.N.M. & Stoica, R.S., 2006. "Perfect simulation for marked point processes," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 679-698, November.
    7. Nicolas Picard & Avner Bar‐Hen & Frédéric Mortier & Joël Chadœuf, 2009. "The Multi‐scale Marked Area‐interaction Point Process: A Model for the Spatial Pattern of Trees," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 36(1), pages 23-41, March.

    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:127:y:2017:i:7:p:2138-2178. 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.