Random Sequential Absorption on Graphs


This paper analyzes a process whereby the vertices ofa graph are considered in a random sequence, and each considered vertex is "occupied" unless it or an adjacent vertex has previously been occupied. The process continues until no more vertices can be occupied, at which point the "jamming limit" has been reached. The case in which the graph is regular (so… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics