English
Related papers

Related papers: A sharp asymptotics of the partition function for …

200 papers

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…

Combinatorics · Mathematics 2022-07-04 Alexander R. Klotz , Everett Sullivan

Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…

Statistical Mechanics · Physics 2023-02-21 Dušanka Marčetić

A phase diagram for a surface interacting long flexible partially directed polymer chain in a two-dimensional poor solvent where the possibility of collapse in the bulk exists is determined using exact enumeration method. We used a model of…

Statistical Mechanics · Physics 2020-12-29 Pramod K Mishra , Yashwant Singh

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…

Biomolecules · Quantitative Biology 2013-06-19 Jacques M. Bahi , Christophe Guyeux , Kamel Mazouzi , Laurent Philippe

We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…

Statistical Mechanics · Physics 2014-09-02 Nicholas R. Beaton

We have investigated a polymer growth process on the triangular lattice where the configurations produced are self-avoiding trails. We show that the scaling behaviour of this process is similar to the analogous process on the square…

Statistical Mechanics · Physics 2011-02-01 Jason Doukas , Aleksander L Owczarek , Thomas Prellberg

We have explained in detail why the canonical partition function of Interacting Self Avoiding Walk (ISAW), is exactly equivalent to the configurational average of the weights associated with growth walks, such as the Interacting Growth Walk…

Statistical Mechanics · Physics 2009-11-13 S. L. Narasimhan , P. S. R. Krishna , M. Ponmurugan , K. P. N. Murthy

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…

Statistical Mechanics · Physics 2022-07-20 C. J. Bradly , A. L. Owczarek

We investigate, by series methods, the behaviour of interacting self-avoiding walks (ISAWs) on the honeycomb lattice and on the square lattice. This is the first such investigation of ISAWs on the honeycomb lattice. We have generated data…

Statistical Mechanics · Physics 2020-06-24 Nicholas R Beaton , Anthony J Guttmann , Iwan Jensen

Polymer chains with hard-core interaction on a two-dimensional lattice are modeled by directed random walks. Two models, one with intersecting walks (IW) and another with non-intersecting walks (NIW) are presented, solved and compared. The…

Condensed Matter · Physics 2016-08-31 G. Forgacs , K. Ziegler

Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersections. On $\mathbb{Z}$, Greven and den Hollander proved in 1993 that the discrete-time weakly self-avoiding walk has an asymptotically…

Probability · Mathematics 2026-05-28 Yucheng Liu

The self-avoiding walk on the square site-diluted correlated percolation lattice is considered. The Ising model is employed to realize the spatial correlations of the metric space. As a well-accepted result, the (generalized) Flory's mean…

Statistical Mechanics · Physics 2018-04-25 J. Cheraghalizadeh , M. N. Najafi , H. Mohammadzadeh , A. Saber

Self-avoiding walks and self-avoiding trails, two models of a polymer coil in dilute solution, have been shown to be governed by the same universality class. On the other hand, self-avoiding walks interacting via nearest-neighbour contacts…

Statistical Mechanics · Physics 2015-06-11 A. Bedini , A. L. Owczarek , T. Prellberg

Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main…

Probability · Mathematics 2020-09-29 Leonardo T. Rolla

The problems considered in the present paper have their roots in two different cultures. The 'true' (or myopic) self-avoiding walk model (TSAW) was introduced in the physics literature by Amit, Parisi and Peliti. This is a nearest neighbor…

Probability · Mathematics 2019-05-20 Illes Horvath , Balint Toth , Balint Veto

Activated Random Walk is a system of interacting particles which presents a phase transition and a conjectured phenomenon of self-organized criticality. In this note, we prove that, in dimension 1, in the supercritical case, when a segment…

Probability · Mathematics 2025-03-28 Nicolas Forien

Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…

Soft Condensed Matter · Physics 2025-10-30 Agniva Datta , Carsten Beta , Robert Großmann

Two closely related models of oriented self-avoiding walks (OSAWs) on a square lattice are studied. We use the pruned-enriched Rosenbluth method to determine numerically the phase diagram. Both models have three phases: a tight-spiral phase…

Condensed Matter · Physics 2007-05-23 G. T. Barkema , U. Bastolla , P. Grassberger

We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…

Probability · Mathematics 2011-08-25 Dmitry Ioffe , Yvan Velenik

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…

Statistical Mechanics · Physics 2016-10-06 Nathan Clisby