Related papers: Generalized random sequential adsorption on Erd\H{…
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues…
The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…
We study analytically and numerically a model of random sequential adsorption (RSA) of segments on a line, subject to some constraints suggested by two kinds of physical situations: - deposition of dimers on a lattice where the sites have a…
The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent…
We analyse the size of an independent set in a random graph on $n$ vertices with specified vertex degrees, constructed via a simple greedy algorithm: order the vertices arbitrarily, and, for each vertex in turn, place it in the independent…
The jamming and percolation for two generalized models of random sequential adsorption (RSA) of linear $k$-mers (particles occupying $k$ adjacent sites) on a square lattice are studied by means of Monte Carlo simulation. The classical…
In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…
Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Here we consider jammed states of the RSA process of nonoverlapping dimers (objects occupying two…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
There has been a long history for studying randomized greedy matching algorithms since the work by Dyer and Frieze~(RSA 1991). We follow this trend and consider the problem formulated in the oblivious setting, in which the algorithm makes…
In this paper, we present a unified study of the limiting density in one-dimensional random sequential adsorption (RSA) processes where segment lengths are drawn from a given distribution. In addition to generic bounds, we are also able to…
The statistics of strongly interacting, ultracold Rydberg gases are governed by the interplay of two factors: geometrical restrictions induced by blockade effects, and quantum mechanical effects. To shed light on their relative roles in the…
Jamming phenomena on a square lattice are investigated for two different models of anisotropic random sequential adsorption (RSA) of linear $k$-mers (particles occupying $k$ adjacent adsorption sites along a line). The length of a $k$-mer…
Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Several studies have recently conjectured that in the RSA of rectangular needles, or $k$-mers, on a square…
Restricted-valence random sequential adsorption~(RSA) is studied in its pure and disordered versions, on the square and triangular lattices. For the simplest case~(pure on the square lattice) we prove the absence of percolation for maximum…
An extension of the Random Sequential Adsorption (RSA) model has been proposed recently, motivated by the coverage of oil droplets by DNA-functionalized colloidal particles. Particles arrive to a flat substrate with a uniform flux F but…
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a…
The random sequential adsorption (RSA) model is a classical model in Statistical Physics for adsorption on two-dimensional surfaces. Objects are deposited sequentially at random and adsorb irreversibly on the landing site, provided that…
We study the exploration of an Erd\"os-R\'enyi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads…
We express the coverage (occupation fraction) $\theta$, in powers of time $t$ for four models of two-dimensional lattice random sequential adsorption (RSA) to very high orders by improving an algorithm developed by the present authors [J.…