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

DOI10.1017/apr.2018.14zbMath1434.82059OpenAlexW2792963086MaRDI QIDQ5215003

Thomas M. M. Meyfroyt

Publication date: 5 February 2020

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/apr.2018.14

zbMATH Keywords

analytical modelinteracting particle systemrandom sequential adsorptionjamming limitcounter-based gossip protocolrandom tree graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Unnamed Item
• Generalized random sequential adsorption on Erdős-Rényi random graphs
• On the scalability and message count of trickle-based broadcasting schemes
• Random sequential adsorption on random trees
• Parking on a random tree
• Multilayer parking with screening on a random tree
• Exact and approximate results for deposition and annihilation processes on graphs
• The jamming constant of uniform random graphs
• The Poincare-Miranda Theorem
• Stochastic Geometry and Wireless Networks: Volume I Theory

This page was built for publication: Degree-dependent threshold-based random sequential adsorption on random trees