相关论文: A new monte carlo algorithm for growing compact Se…
Polymer chains undergoing a continuous adsorption-desorption transition are studied through extensive computer simulations. A three-dimensional self-avoiding walk lattice model of a polymer chain grafted onto a surface has been treated for…
We have analyzed geometric and topological features of self-avoiding walks. We introduce a new kind of walk: the loop-deleted self-avoiding walk (LDSAW) motivated by the interaction of chromatin with the nuclear lamina. Its critical…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
One way to approximate a quantum annealing schedule is to use multiple quantum walks chained together, without intermediate measurements, to produce a multi-stage quantum walk (MSQW). Previous work has shown that a MSQW is better than QAOA…
We propose an algorithmic strategy for improving the efficiency of Monte Carlo searches for the low-energy states of proteins. Our strategy is motivated by a model of how proteins alter their shapes. In our model when proteins fold under…
The study of the effect of random impurities on the collapse of a flexible polymer in dilute solution has had recent attention with consideration of semi-stiff interacting self-avoiding walks on the square lattice. In the absence of…
We study by computer simulation a recently introduced generalised model of self-interacting self-avoiding trails on the square lattice that distinguishes two topologically different types of self-interaction: namely crossings where the…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
We investigate asymptotical behavior of numbers of long Hamiltonian walks (HWs), i.e. self-avoiding random walks that visit every site of a lattice, on various fractal lattices. By applying an exact recursive technique we obtain scaling…
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
Long linear polymers in dilute solutions are known to undergo a collapse transition from a random coil (expand itself) to a compact ball (fold itself up) when the temperature is lowered, or the solvent quality deteriorates. A natural model…
The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that…
In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimum scaling factor such that the sets…
We perform a numerical study of a new microcanonical polymer model on the three dimensional cubic lattice, consisting of ideal chains whose range and number of nearest-neighbor contacts are fixed to given values. Our simulations suggest an…
We perform a Monte Carlo simulation of two-dimensional N-step interacting self-avoiding walks at the theta point, with lengths up to N=3200. We compute the critical exponents, verifying the Coulomb-gas predictions, the theta-point…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
We introduce a diffusion model for energetically inhomogeneous systems. A random walker moves on a spin-S Ising configuration, which generates the energy landscape on the lattice through the nearest-neighbors interaction. The underlying…
Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the…
A fundamental paradigm in polymer physics is that macromolecular conformations in equilibrium can be described by universal scaling laws, being key for structure, dynamics, and function of soft (biological) matter and in the materials…