Nearest-neighbor statistics in a one-dimensional random sequential adsorption process

1996 ◽  
Vol 53 (1) ◽  
pp. 450-457 ◽  
Author(s):  
M. D. Rintoul ◽  
S. Torquato ◽  
G. Tarjus
Keyword(s):  
Nearest Neighbor ◽  
Adsorption Process ◽  
Random Sequential Adsorption ◽  
One Dimensional ◽  
Sequential Adsorption

Degree-dependent threshold-based random sequential adsorption on random trees

2018 ◽  
Vol 50 (01) ◽  
pp. 302-326
Author(s):  
Thomas M. M. Meyfroyt
Keyword(s):  
Nearest Neighbor ◽  
Random Order ◽  
Blocking Effect ◽  
Random Trees ◽  
Random Sequential Adsorption ◽  
Neighbor Interaction ◽  
Tree Graphs ◽  
Infinite Tree ◽  
Sequential Adsorption ◽  
Activation Probability

Abstract We consider a special version of random sequential adsorption (RSA) with nearest-neighbor interaction on infinite tree graphs. In classical RSA, starting with a graph with initially inactive nodes, each of the nodes of the graph is inspected in a random order and is irreversibly activated if none of its nearest neighbors are active yet. We generalize this nearest-neighbor blocking effect to a degree-dependent threshold-based blocking effect. That is, each node of the graph is assumed to have its own degree-dependent threshold and if, upon inspection of a node, the number of active direct neighbors is less than that node's threshold, the node will become irreversibly active. We analyze the activation probability of nodes on an infinite tree graph, given the degree distribution of the tree and the degree-dependent thresholds. We also show how to calculate the correlation between the activity of nodes as a function of their distance. Finally, we propose an algorithm which can be used to solve the inverse problem of determining how to set the degree-dependent thresholds in infinite tree graphs in order to reach some desired activation probabilities.

Duality for Random Sequential Adsorption on a Lattice

1992 ◽  
Vol 1 (3) ◽  
pp. 219-222 ◽  
Author(s):  
Y. Fan ◽  
J. K. Percus
Keyword(s):  
Random Walks ◽  
Time Dependence ◽  
Nearest Neighbor ◽  
Nearest Neighbors ◽  
Random Sequential Adsorption ◽  
Occupied Site ◽  
Sequential Adsorption ◽  
The Given

If particles are dropped randomly on a lattice, with a placement being cancelled if the site in question or a nearest neighbor is already occupied, an ensemble of restricted random walks is created. We seek the time dependence of the expected occupation of a given site. It is shown that this problem reduces to one of enumerating walks from the given site in which a move can only be made to a previously occupied site or one of its nearest neighbors.

scholarly journals A Computer-Aided Model for the Simulation of Railway Ballast by Random Sequential Adsorption Process

2017 ◽  
Vol 33 (3) ◽  
pp. 243-257 ◽  
Author(s):  
Andrea Benedetto ◽  
Luca Bianchini Ciampoli ◽  
Maria Giulia Brancadoro ◽  
Amir M. Alani ◽  
Fabio Tosti
Keyword(s):  
Adsorption Process ◽  
Random Sequential Adsorption ◽  
Railway Ballast ◽  
Computer Aided ◽  
Sequential Adsorption
Sign in / Sign up

Export Citation Format

Share Document