Generalized random sequential adsorption on Erdős-Rényi random graphs

DOI10.1007/s10955-016-1583-zzbMath1364.82038arXiv1604.03918OpenAlexW3100935448WikidataQ59460908 ScholiaQ59460908MaRDI QIDQ504210

Johan S. H. van Leeuwaarden, Debankur Mukherjee, Souvik Dhara

Publication date: 25 January 2017

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.03918

zbMATH Keywords

random graphsfrequency assignmentparking problemgreedy independent setjamming limitrandom sequential adsoption

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Related Items (3)

Scaling limits and generic bounds for exploration processes ⋮ Corrected mean-field model for random sequential adsorption on random geometric graphs ⋮ Degree-dependent threshold-based random sequential adsorption on random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Scaling limits and generic bounds for exploration processes
• On the scalability and message count of trickle-based broadcasting schemes
• Random sequential adsorption on random trees
• A second-row parking paradox
• On the independence number of random graphs
• Parking on a random tree
• Multilayer parking with screening on a random tree
• The jamming constant of uniform random graphs
• On-Line Coloring of Sparse Random Graphs and Random Trees
• On independent sets in random graphs
• The Greedy Independent Set in a Random Graph with Given Degrees
• Random parking, sequential adsorption, and the jamming limit

This page was built for publication: Generalized random sequential adsorption on Erdős-Rényi random graphs