Scaling Limits and Generic Bounds for Exploration Processes

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its neighboring nodes become blocked. Given an initial number of verti...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2017
Materias:
Random graphs
Random sequential adsorption
Scaling limits
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00224715_v169_n5_p989_Bermolen
http://hdl.handle.net/20.500.12110/paper_00224715_v169_n5_p989_Bermolen
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares