Related papers: Percolation connectivity in deposits obtained usin…
In string percolation model, the study of colliding systems at high energies is based on a continuum percolation theory in two dimensions where the number of strings distributed in the surface of interest is strongly determined by the size…
We consider the model of random sequential adsorption, with depositing objects, as well as those already at the surface, decreasing in size according to a specified time dependence, from a larger initial value to a finite value in the large…
Random sequential adsorption (RSA) models have been studied due to their relevance to deposition processes on surfaces. The depositing particles are represented by hard-core extended objects; they are not allowed to overlap. Numerical Monte…
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 this work, we present a variant of the multilayer random sequential adsorption (RSA) process that is inspired by orthogonal resource sharing in wireless communication networks. In the one-dimensional (1D) version of this variant, the…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
The collision dynamics of hard spheres and cylindrical pores is solved exactly, which is the minimal model for a regularly porous membrane. Nonequilibrium event-driven molecular dynamics simulations are used to show that the permeability…
Vapor adsorption experiments are widely used to assess pore size distributions, but the large hysteresis sometimes observed between sorption and desorption isotherms remains difficult to interpret. Such hysteresis is influenced pore network…
We study by Monte Carlo computer simulations random sequential adsorption (RSA) with diffusional relaxation, of lattice hard squares in two dimensions. While for RSA without diffusion the coverage approaches its maximum jamming value…
Random tilings or packings in the plane are characterized by a size distribution of individual elements (domains) and by the statistics of neighbor relations between the domains. Most systems occurring in nature or technology have a…
Irreversible adsorption of spheres on flat collectors having dimension $d<2$ is studied. Molecules are adsorbed on Sierpinski's Triangle and Carpet like fractals ($1<d<2$), and on General Cantor Set ($d<1$). Adsorption process is modeled…
Adsorption of trimers and hexamers built of identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Particles were adsorbed on a two dimensional, flat and homogeneous surface. Numerical simulations…
Saturated random packing of particles built of two identical, relatively shifted spheres in two and three dimensional flat and homogeneous space was studied numerically using random sequential adsorption algorithm. The shift between centers…
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 present results of a new model of sequential adsorption in which the adsorbing particles are correlated with the particles attached to the substrate. The strength of the correlations is measured by a tunable parameter $\sigma$. The model…
We simulate a model of self-propelled disks with soft repulsive interactions confined to a box in two dimensions. For small rotational diffusion rates, monodisperse disks spontaneously accumulate at the walls. At low densities, interaction…
We study two-dimensional random sequential adsorption (RSA) of flat polygons and rounded squares aligned in parallel to find a transition in the asymptotic behavior of the kinetics of packing growth. Differences in the kinetics for RSA of…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
The first theoretical study of a dimer's adsorption process at homogenous surface is presented. By using the RSA algorithm, we show example monolayers, discuss estimations of random jamming coverage and measure the surface blocking…