相关论文: Knot Probability for Self-Avoiding Loops on a Cubi…
The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…
We have studied kinetics of random sequential adsorption of mixtures on a square lattice using Monte Carlo method. Mixtures of linear short segments and long segments were deposited with the probability $p$ and $1-p$, respectively. For…
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
We present a Monte Carlo method that allows efficient and unbiased sampling of Hamiltonian walks on a cubic lattice. Such walks are self-avoiding and visit each lattice site exactly once. They are often used as simple models of globular…
In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…
We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…
This article presents SAWdoubler, a package for counting the total number Z(N) of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic concept has been published previously by us. We discuss an…
We compute for the first time the effects of excluded volume on the probability for double-stranded DNA to form a loop. We utilize a Monte-Carlo algorithm for generation of large ensembles of self- avoiding worm-like chains, which are used…
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the infinite cluster,…
We study a model of "elastic" lattice polymer in which a fixed number of monomers $m$ is hosted by a self-avoiding walk with fluctuating length $l$. We show that the stored length density $\rho_m = 1 - <l>/m$ scales asymptotically for large…
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…
Tying knots and linking microscopic loops of polymers, macromolecules, or defect lines in complex materials is a challenging task for material scientists. We demonstrate the knotting of microscopic topological defect lines in chiral nematic…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
There is extensive recent experimental evidence of spontaneous superlattice (SL) formation in various II-VI and III-V semiconductors. Here we propose an atomistic mechanism responsible for SL formation, and derive a relation predicting the…
We show how to compute the generating function of the self-avoiding polygons on a lattice by using the statistical mechanics Schwinger-Dyson equations for the correlation functions of the $N$-vector spin model on that lattice.
The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…
We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…
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…