Related papers: A simple self-avoiding walking process as a reason…
In this paper we study a two-dimensional directed self-avoiding walk model of a random copolymer in a random emulsion. The copolymer is a random concatenation of monomers of two types, $A$ and $B$, each occurring with density 1/2. The…
The conformational and electronic properties of conducting flexible random and self-avoiding walk polymer chains are under investigation. A Hamiltonian for conjugated flexible polymers is introduced and its physical consequences are…
Single linear polymer chains in dilute solutions under good solvent conditions are studied by Monte Carlo simulations with the pruned-enriched Rosenbluth method up to the chain length $N \sim {\cal O}(10^4)$. Based on the standard simple…
We investigate the mechanism of chain exchange in diblock copolymer micelles using two distinct yet complementary simulation techniques. First, enhanced sampling method is combined with coarse-grained molecular dynamics to compute a…
We introduce an efficient nonreversible Markov chain Monte Carlo algorithm to generate self-avoiding walks with a variable endpoint. In two dimensions, the new algorithm slightly outperforms the two-move nonreversible Berretti-Sokal…
The separability of clusters is one of the most desired properties in clustering. There is a wide range of settings in which different clusterings of the same data set appear. We are interested in applications where there is a need for an…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
We use the recently conjectured exact $S$-matrix of the massive ${\rm O}(n)$ model to derive its form factors and ground state energy. This information is then used in the limit $n\to0$ to obtain quantitative results for various universal…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
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…
This paper studies a polymer chain in the vicinity of a linear interface separating two immiscible solvents. The polymer consists of random monomer types, while the interface carries random charges. Both the monomer types and the charges…
Understanding and computing the entropic forces exerted by polymer chains under confinement is important for many reasons, from research to applications. However, extracting properties related to the free energy, such as the force (or…
Molecular process of polymer collapse was reproduced by isothermal molecular dynamics simulation. The initial polymer chains were obtained by mean of random walks in continuum space. Two potential models were considered to represent short…
Follower activity results in a large variety of conformational and dynamical states in active chains and filaments. These states are formed due to the coupling between chain geometry and the local activity. We study the origin and emergence…
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…
We analyze the motion of individual beads of a polymer chain using a discrete version of De Gennes' reptation model that describes the motion of a polymer through an ordered lattice of obstacles. The motion within the tube can be evaluated…
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…