Random Sequential Adsorption on Graphs

DOI10.1137/0402034MaRDI QIDQ3825904zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0402034

zbMATH Keywords

jamming limitquotient graphsrandom regular graphs

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)

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

(16)

• Random and cooperative sequential adsorption on infinite ladders and strips
• Corrected mean-field model for random sequential adsorption on random geometric graphs
• Exact and approximate results for deposition and annihilation processes on graphs
• The matching process and independent process in random regular graphs and hypergraphs
• The jamming constant of uniform random graphs
• The expected duration of random sequential adsorption
• On the random sequential adsorption of d-dimensional cubes
• EMPTINESS PROBABILITIES IN RANDOM SEQUENTIAL ADSORPTION ON THE BETHE LATTICE
• A multitype random sequential process. II. Distribution of particle size and vacant space length in the saturation limit
• Percolation of even sites for random sequential adsorption
• Generalized random sequential adsorption on Erdős-Rényi random graphs
• Birds on a wire
• Degree-dependent threshold-based random sequential adsorption on random trees
• Dynamic space packing
• Scaling limits and generic bounds for exploration processes
• Random sequential adsorption on random trees

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)