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

Thomas M.M. Meyfroyt

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)302-326
Number of pages25
JournalAdvances in Applied Probability
Issue number1
Publication statusPublished - 1 Mar 2018


  • Analytical model
  • counter-based gossip protocol
  • interacting particle system
  • jamming limit
  • random sequential adsorption
  • random tree graph


Dive into the research topics of 'Degree-dependent threshold-based random sequential adsorption on random trees'. Together they form a unique fingerprint.

Cite this