Abstract
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed state when no further additions are possible. We analyze a class of RSA models on a two-row square ladder graph in which landing on an empty site in a graph is allowed when at least $b$ neighboring sites in the graph are unoccupied ($b \in \mathbb{N}$). In this paper we complement this typical way of studying RSA models by analyzing also the structure of the set of all jammed states in a static way, disregarding the dynamics that led to a particular jammed state. In both considered settings (dynamic and static) we provide explicit expressions for key statistics that describe the average proportion of the substrate covered by deposited objects, and then we comment on significant differences between the two settings. We illustrate all of our findings through a toy model for ensembles of trapped Rydberg atoms with blockade range $b$.
Introduction
Random Sequential Adsorption (RSA) describes processes where objects are placed on a substrate one by one, subject to specific exclusion rules. A classic example is the "car parking problem" on a 1D line. This research extends RSA to a two-row square ladder graph, a structure intermediate between 1D and 2D geometries.
The model assumes a "blockade range" $b$, where an object (representing an excited Rydberg atom) can only occupy a site if all neighbors within distance $b$ are empty. This mimics the physical blockade effect in quantum simulators, where one excited atom prevents its neighbors from being excited. The system eventually reaches a "jammed" state where no more objects can be added without violating the blockade rule.
Methods: Dynamic vs. Static Analysis
The study employs two distinct analytical frameworks to understand the jamming limit:
- The Dynamic Model: This approach simulates the sequential deposition process. Using recursive relations and generating functions, the authors derive a differential equation to find the expected density of objects in the final jammed state.
- The Static (Equilibrium) Model: This approach analyzes the set of all possible jammed configurations as a static ensemble, assuming each is equally likely. A renewal approach and bivariate generating functions are used to calculate the configurational entropy and the density that maximizes the number of possible states.
By comparing these two models, the researchers test the Edwards hypothesis, which suggests that the final state of a jammed system is independent of the dynamics that created it.
Key Results and Insights
- Failure of the Edwards Hypothesis: The dynamic jamming limit and the static equilibrium density are fundamentally different. For $b=1$ (nearest-neighbor exclusion), the dynamic density is approximately $0.8161$, while the equilibrium density is lower, at approximately $0.7236$. This proves that the history of the deposition process significantly influences the final state.
- Convergence to 1D Limits: As the blockade range $b$ becomes large, the dynamic model on the ladder graph converges to Rényi’s car-parking constant ($\approx 0.7476$).
- Scaling Behavior: By scaling the density by $2b$, the authors show that the system's behavior stabilizes for large $b$, allowing for direct comparison across different blockade ranges.
- The $b \to \infty$ Divergence: Interestingly, while the dynamic model converges to a constant, the static model's scaled density converges to 1 as $b$ increases, indicating that the "history" of excitation becomes even more dominant in determining the final density at large blockade ranges.
Conclusion and Future Work
This work provides the first closed-form analytical solutions for RSA on a ladder graph with variable blockade range. While the two-row geometry allows for exact solutions, extending this to $m > 2$ rows remains a challenge due to the increased complexity of subgraph decomposition. Future research will explore non-integral blockade ranges to better model physical Rydberg atoms and apply these findings to other geometries like hexagonal lattices.
Summary updated