The jamming constant of uniform random graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Stochastic Processes and their Applications Année : 2017

The jamming constant of uniform random graphs

Résumé

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.
Fichier principal
Vignette du fichier
1310.8475 (669.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03294727 , version 1 (05-12-2023)

Identifiants

Citer

Paola Bermolen, Matthieu Jonckheere, Pascal Moyal. The jamming constant of uniform random graphs. Stochastic Processes and their Applications, 2017, 127 (7), pp.2138-2178. ⟨10.1016/j.spa.2016.10.005⟩. ⟨hal-03294727⟩
30 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More