2018
DOI: 10.1017/apr.2018.14
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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-dep… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Theorems 1-3 also contribute to the mathematical perspective. The study of exploration processes of the RSA type on random graphs has seen interest in recent years [24,[36][37][38][39][40][41][42]. The tools necessary from probability theory to analyze said processes include, e.g., random graph couplings, fluid and diffusion limits, stochastic differential equations, and martingale analyses, and the current work extends this framework in two ways.…”
Section: Introductionmentioning
confidence: 99%
“…Theorems 1-3 also contribute to the mathematical perspective. The study of exploration processes of the RSA type on random graphs has seen interest in recent years [24,[36][37][38][39][40][41][42]. The tools necessary from probability theory to analyze said processes include, e.g., random graph couplings, fluid and diffusion limits, stochastic differential equations, and martingale analyses, and the current work extends this framework in two ways.…”
Section: Introductionmentioning
confidence: 99%
“…Theorems 1-3 also contribute to the mathematical perspective. The study of exploration processes of the RSA type on random graphs has seen interest in recent years [20,[32][33][34][35][36][37][38]. The tools necessary from probability theory to analyze said processes include e.g.…”
Section: Introductionmentioning
confidence: 99%