Generalized random sequential adsorption on Erdős-Rényi random graphs
arXiv:1604.03918 · doi:10.1007/s10955-016-1583-z
Abstract
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the 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ős-Rényi random graph. We consider these generalizations in the large-graph limit and characterize the jamming constant, the limiting proportion of active vertices in the maximal greedy set.
arXiv comment20 pages, 4 figures in Journal of Statistical Physics, 2016
References in corpus (8)
- Random Sequential Adsorption: From Continuum to Lattice and Pre-Patterned Substrates
- On independent sets in random graphs
- Properties of random sequential adsorption of generalized dimers
- Parking on a Random Tree
- Jamming and percolation in generalized models of random sequential adsorption of linear -mers on a square lattice
- On the Scalability and Message Count of Trickle-based Broadcasting Schemes
- A second row Parking Paradox
- Multilayer parking with screening on a random tree