Artículo
The jamming constant of uniform random graphs
Fecha de publicación:
07/2017
Editorial:
Elsevier Science
Revista:
Stochastic Processes And Their Applications
ISSN:
0304-4149
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Bermolen, Paola; Jonckheere, Matthieu Thimothy Samson; Moyal, Pascal; The jamming constant of uniform random graphs; Elsevier Science; Stochastic Processes And Their Applications; 127; 7; 7-2017; 2138-2178
Compartir
Altmétricas