Random Sequential Adsorption on Graphs
From MaRDI portal
Recommendations
- Generalized random sequential adsorption on Erdős-Rényi random graphs
- EMPTINESS PROBABILITIES IN RANDOM SEQUENTIAL ADSORPTION ON THE BETHE LATTICE
- Exact and approximate results for deposition and annihilation processes on graphs
- Random sequential adsorption on random trees
- The expected duration of random sequential adsorption
Cited in
(14)- EMPTINESS PROBABILITIES IN RANDOM SEQUENTIAL ADSORPTION ON THE BETHE LATTICE
- Percolation of even sites for random sequential adsorption
- The jamming constant of uniform random graphs
- Corrected mean-field model for random sequential adsorption on random geometric graphs
- A multitype random sequential process. II. Distribution of particle size and vacant space length in the saturation limit
- The expected duration of random sequential adsorption
- Dynamic space packing
- Scaling limits and generic bounds for exploration processes
- Random sequential adsorption on random trees
- On the random sequential adsorption of d-dimensional cubes
- The matching process and independent process in random regular graphs and hypergraphs
- Degree-dependent threshold-based random sequential adsorption on random trees
- Exact and approximate results for deposition and annihilation processes on graphs
- Generalized random sequential adsorption on Erdős-Rényi random graphs
This page was built for publication: Random Sequential Adsorption on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825904)