Generalized random sequential adsorption on Erdős-Rényi random graphs

Abstract: We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the $n$ vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of the state of the neighboring vertices. The classical RSA rule declares a vertex active if none of its neighbors is, in which case the set of active nodes forms an independent set of the graph. We generalize this nearest-neighbor blocking rule in three ways and apply it to the Erd\H{o}s-R\'enyi random graph. We consider these generalizations in the large-graph limit $n\to\infty$ and characterize the jamming constant, the limiting proportion of active vertices in the maximal greedy set.