Related papers: High-precision estimate of the hydrodynamic radius…
We perform simulations for long hard-sphere polymer chains using a recently developed binary-tree based Monte Carlo method. Systems in two to five dimensions with free and periodic boundary conditions and up to $10^7$ repeat units are…
We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We report the results of extensive Dynamic Monte Carlo simulations of systems of self-assembled Equilibrium Polymers without rings in good solvent. Confirming recent theoretical predictions, the mean-chain length is found to scale as $\Lav…
We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
In this paper we study the shape characteristics of a polymer chain in a good solvent using a mesoscopic level of modelling. The dissipative particle dynamics simulations are performed in the $3D$ space at a range of chain lengths $N$. The…
Scaling law for geometrical and dynamical quantities of biological molecules is an interesting topic. According to Flory's theory, a power law between radius of gyration and the length of homopolymer chain is found, with exponent 3/5 for…
The present research is dedicated to provide deeper understanding of the impact of complex architecture of branched polymers on their behaviour in solvents. The folding dynamics of macromolecules and hydrodynamics of polymer fluids are…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
We study the winding angles of random and self-avoiding walks on square and cubic lattices with number of steps $N$ ranging up to $10^7$. We show that the mean square winding angle $\langle\theta^2\rangle$ of random walks converges to the…
In two dimensions polymer collapse has been shown to be complex with multiple low temperature states and multi-critical points. Recently, strong numerical evidence has been provided for a long-standing prediction of universal scaling of…
We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent $\nu$ are obtained. They are in…
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…
We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…
We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…
We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…
We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that \mu = 4.684 039 931(27). Our method also provides…
The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures…
The harmonic measure (or diffusion field or electrostatic potential) near a percolation cluster in two dimensions is considered. Its moments, summed over the accessible external hull, exhibit a multifractal spectrum, which I calculate…