Related papers: A simple self-avoiding walking process as a reason…
A polymer chain containing $N$ monomers confined in a finite cylindrical tube of diameter $D$ grafted at a distance $L$ from the open end of the tube may undergo a rather abrupt transition, where part of the chain escapes from the tube to…
This study introduces an algorithm that generates undirected graphs with three main characteristics of real-world networks: scale-freeness, short distances between nodes (small-world phenomenon), and large clustering coefficients. The main…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
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…
We consider random walk model of a semi-flexible polymer chain on a square and a cubic lattice to enumerate conformations of the polymer chain in two and three dimensions, respectively. The bending energy of the chain is assumed as the key…
The self-avoid random walk algorithm has been extensively used in the study of polymers. In this work we study the basic properties of the trajectories generated with this algorithm when two interactions are added to it: contact and folding…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
We present a new simulation technique to study systems of polymers functionalized by reactive sites that bind/unbind forming reversible linkages. Functionalized polymers feature self-assembly and responsive properties that are unmatched by…
This paper considers an undirected polymer chain on $\mathbb{Z}^d$, $d \geq 2$, with i.i.d.\ random charges attached to its constituent monomers. Each self-intersection of the polymer chain contributes an energy to the interaction…
We use a bath of chaotic surface waves in water to mechanically and macroscopically mimic the thermal behavior of a short articulated chain with only nearest-neighbor interactions. The chaotic waves provide isotropic and random agitation to…
We analyse the conformational behaviour of a linear semiflexible homo-polymer chain confined by two geometrical constraints under a good solvent condition in two dimensions. The constraints are stair shaped impenetrable surfaces. The…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…
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…
Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…
We describe method to discuss thermodynamics of a defected semi-flexible homo-polymer chain in the two and three dimensions using fully directed self-avoiding walk lattice model. The defects are located along a line and these defects are…
We present the noise free escape of a chain of linearly interacting units from a metastable state over a cubic on-site potential barrier. The underlying dynamics is conservative and purely deterministic. The mutual interplay between…
We study a system composed of two parallel totally asymmetric simple exclusion processes with open boundaries, where the particles move in the two lanes in opposite directions and are allowed to jump to the other lane with rates inversely…
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…
We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…
Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…