English
Related papers

Related papers: Kinetics and Jamming Coverage in a Random Sequenti…

200 papers

We present a Monte Carlo algorithm that provides efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice with rod geometry L x L x rL and non-periodic…

Statistical Mechanics · Physics 2010-11-03 Jesper Lykke Jacobsen

The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…

Condensed Matter · Physics 2013-11-18 Bertrand Duplantier

We consider the survival probability $f(t)$ of a random walk with a constant hopping rate $w$ on a host lattice of fractal dimension $d$ and spectral dimension $d_s\le 2$, with spatially correlated traps. The traps form a sublattice with…

Statistical Mechanics · Physics 2016-11-23 Dan Plyukhin , Alex V. Plyukhin

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…

Statistical Mechanics · Physics 2022-04-15 Zbigniew Koza , Grzegorz Kondrat

We discuss the adsorption of semiflexible polymers to a planar attractive wall and focus on the questions of the adsorption threshold for polymers of {\it finite} length and their loop and tail distributions using both Monte-Carlo…

Soft Condensed Matter · Physics 2017-07-19 Tobias Alexander Kampmann , Jan Kierfeld

Single three dimensional polymers confined to a slab, i.e. to the region between two parallel plane walls, are studied by Monte Carlo simulations. They are described by $N$-step walks on a simple cubic lattice confined to the region $1 \le…

Soft Condensed Matter · Physics 2009-11-10 Hsiao-Ping Hsu , Peter Grassberger

Search patterns of randomly oriented steps of different lengths have been observed on all scales of the biological world, ranging from the microscopic to the ecological, including in protein motors, bacteria, T-cells, honeybees, marine…

Quantitative Methods · Quantitative Biology 2020-02-14 Brieuc Guinard , Amos Korman

Using the pruned-enriched Rosenbluth Monte Carlo algorithm, the scattering functions of semiflexible macromolecules in dilute solution under good solvent conditions are estimated both in $d=2$ and $d=3$ dimensions, considering also the…

Soft Condensed Matter · Physics 2015-06-11 Hsiao-Ping Hsu , Wolfgang Paul , Kurt Binder

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched…

Disordered Systems and Neural Networks · Physics 2010-04-13 V. Blavatska , W. Janke

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…

Statistical Mechanics · Physics 2009-11-07 C. Fusco , P. Gallo , A. Petri , M. Rovere

We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…

Probability · Mathematics 2018-10-02 Julien Poisat , François Simenhaus

We obtain long series (28 terms or more) for the coverage (occupation fraction) $\theta$, in powers of time $t$ for two models of random sequential adsorption with diffusional relaxation using an efficient algorithm developed by the…

Condensed Matter · Physics 2009-10-28 Chee Kwan Gan , Jian-Sheng Wang

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

Probability · Mathematics 2024-12-18 Sam Olesker-Taylor , Thomas Sauerwald , John Sylvester

We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…

Statistical Mechanics · Physics 2009-10-31 Jian-Sheng Wang

We study the percolation and jamming of rods ($k$-mers) on a square lattice that contains defects. The point defects are placed randomly and uniformly on the substrate before deposition of the rods. The general case of unequal probabilities…

An efficient algorithm for random sequential adsorption of hard discs in two dimensions is implemented. A precise value for the coverage is obtained: theta(infty) = 0.547069. The asymptotic law theta(t) = theta(infty) - ct^{-1/2} is…

Condensed Matter · Physics 2015-06-25 Jian-Sheng WANG

Consistently predicting biopolymer structure at atomic resolution from sequence alone remains a difficult problem, even for small sub-segments of large proteins. Such loop prediction challenges, which arise frequently in comparative…

Biomolecules · Quantitative Biology 2014-03-05 Rhiju Das

We use numerical Monte Carlo simulation to study kinetics of deposition of oriented superdisks, bounded by the Lame curves of the form $|x|^{2p}+|y|^{2p}=1$, on regular planar substrate. It was recently shown that the maximum packing…

Soft Condensed Matter · Physics 2015-06-16 B. N. Aleksić , N. M. Švrakić , M. Belić

A phase diagram for a surface-interacting long flexible polymer chain in a two-dimensional poor solvent where the possibility of collapse exists is determined using exact enumeration method. A model of a self-attracting self avoiding walk…

Statistical Mechanics · Physics 2007-05-23 Yashwant Singh , Debaprasad Giri , Sanjay Kumar

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…

Probability · Mathematics 2024-03-22 Roger Fan , Nitya Mani