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, ...

We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes ...

Understanding the function of stochasticity in biological systems has been a long-standing challenge 1,2,3. Two main principles have been recognized. First, stochastic algorithms allow simpler genetic ...