Related papers: Irreversible Deposition of Line Segment Mixtures o…
We use an off-lattice microscopic model for solutions of equilibrium polymers (EP) in a lamellar shear flow generated by means of a self-consistent external field between parallel hard walls. The individual conformations of the chains are…
This paper considers the Monte Carlo dynamics of random dimer coverings of the square lattice, which can be mapped to a rough interface model. Two kinds of slow modes are identified, associated respectively with long-wavelength fluctuations…
We discuss a Monte Carlo Markov Chain (MCMC) procedure for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We show that an approach inspired by optimal transport allows us to bound…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…
We propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…
We present Monte Carlo computer simulations for melts of semiflexible randomly knotted and randomly concatenated ring polymers on the fcc lattice and in slit confinement. Through systematic variation of the slit width at fixed melt density,…
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…
In this paper, we study the mixing time of Markov Chain Monte Carlo (MCMC) for integer least-square (LS) optimization problems. It is found that the mixing time of MCMC for integer LS problems depends on the structure of the underlying…
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the…
We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…
We report studies of random sequential adsorption on the pre-patterned Bethe lattice. We consider a partially covered Bethe lattice, on which monomers and dimers deposit competitively. Analytical solutions are obtained and discussed in the…
The influence of lateral adsorbate diffusion on the dynamics of the first-order phase transition in a two-dimensional Ising lattice gas with attractive nearest-neighbor interactions is investigated by means of kinetic Monte Carlo…
Many problems in materials science and biology involve particles interacting with strong, short-ranged bonds, that can break and form on experimental timescales. Treating such bonds as constraints can significantly speed up sampling their…
We present some results of Monte Carlo simulations for the deposition of particles of different sizes on a two-dimensional substrate. The particles are linear, height one, and can be deposited randomly only in the two, $x$ and $y$…
Jamming and percolation of three-dimensional (3D) $k \times k \times k $ cubic objects ($k^3$-mers) deposited on simple cubic lattices have been studied by numerical simulations complemented with finite-size scaling theory. The $k^3$-mers…
Monte Carlo simulations of coarse-grained polymers provide a useful tool to deepen the understanding of conformational and statistical properties of polymers both in physical as well as in biological systems. In this study we sample compact…
Using computer simulation, we have studied the random sequential adsorption of stiff linear $k$-mers onto a square lattice. Each such particle occupies $k$ adjacent lattice sites. During deposition, the two mutually perpendicular…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
This work studies the jamming and percolation of parallel squares in a single-cluster growth model. The Leath-Alexandrowicz method was used to grow a cluster from an active seed site. The sites of a square lattice were occupied by addition…