Related papers: A model of random sequential adsorption on a ladde…
Simulating a shared register can mask the intricacies of designing algorithms for asynchronous message-passing systems subject to crash failures, since it allows them to run algorithms designed for the simpler shared-memory model. Typically…
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…
Using the density matrix renormalization group algorithm, we map the ground-state phase diagram of a two-leg Rydberg ladder array with lattice spacings $a_x=2a_y$. We identify various density wave phases that spontaneously break the…
Ordered protein layers are the subject of active biomedical research for their usually interesting physicochemical properties, e.g. permeability, stiffness and pours structure. In presented work, we focused on layers build of fibrinogen…
Stochastic processes can model many emerging phenomena on networks, like the spread of computer viruses, rumors, or infectious diseases. Understanding the dynamics of such stochastic spreading processes is therefore of fundamental interest.…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
In this article, we study a type of a one dimensional percolation model whose basic features include a sequential dropping of particles on a substrate followed by their transport via a pushing mechanism (see [S. N. Majumdar and D. S. Dean,…
We propose a generalized car parking problem where cars of two different sizes are sequentially parked on a line with a given probability $q$. The free parameter $q$ interpolates between the classical car parking problem of only one car…
We consider a reaction-diffusion process with retardation. The particles, immersed in traps initially, remain inactive until another particle is annihilated spontaneously with a rate $\lambda$ at a certain point $\vec x$. In that case the…
The adsorption of a single multi-block $AB$-copolymer on a solid planar substrate is investigated by means of computer simulations and scaling analysis. It is shown that the problem can be mapped onto an effective homopolymer adsorption…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
Random sequential adsorption with diffusional relaxation, of two by two square objects on the two-dimensional square lattice is studied by Monte Carlo computer simulation. Asymptotically for large lattice sizes, diffusional relaxation…
We present a number models describing the sequential deposition of a mixture of particles whose size distribution is determined by the power-law $p(x) \sim \alpha x^{\alpha-1}$, $x\leq l$ . We explicitly obtain the scaling function in the…
We examine the phase transition of polymer adsorption as well as the underlying kinetics of polymer binding from dilute solutions on a structureless solid surface. The emphasis is put on the properties of regular multiblock copolymers,…
We have performed extensive simulations of random sequential adsorption and diffusion of $k$-mers, up to $k=5$ in two dimensions with particular attention to the case $k=2$. We focus on the behavior of the coverage and of vacancy dynamics…
Kinetics of random sequential adsorption (RSA) of spheres on flat, two-dimensional surfaces is governed by a power law with exponent $-1/2$. The study has shown that for RSA of nearly spherically symmetric particles this exponent is $-1/3$,…
A broad class of blocked or jammed configurations of particles on the one-dimensional lattice can be characterized in terms of local rules involving only the lengths of clusters of particles (occupied sites) and of holes (empty sites).…
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed independently by each robot so that all robots meet at a single…
Random sequential adsorption of linear and square particles with excluded volume interaction is studied numerically on planar lattices considering Gaussian distributions of lateral sizes of the incident particles, with several values of the…