We consider a model of semiflexible interacting self-avoiding trails (sISATs) on a lattice, where the walks are constrained to visit each lattice edge at most once. Such models have been studied as an alternative to the self-attracting self-avoiding walks (SASAWs) to investigate the collapse transition of polymers, with the attractive interactions being on site as opposed to nearest-neighbor interactions in SASAWs. The grand-canonical version of the sISAT model is solved on a four-coordinated Bethe lattice, and four phases appear: non-polymerized (NP), regular polymerized (P), dense polymerized (DP), and anisotropic nematic (AN), the last one present in the phase diagram only for sufficiently stiff chains. The last two phases are dense, in the sense that all lattice sites are visited once in the AN phase and twice in the DP phase. In general, critical NP-P and DP-P transition surfaces meet with a NP-DP coexistence surface at a line of bicritical points. The region in which the AN phase is stable is limited by a discontinuous critical transition to the P phase, and we study this somewhat unusual transition in some detail. In the limit of rods, where the chains are totally rigid, the P phase is absent and the three coexistence lines (NP-AN, AN-DP, and NP-DP) meet at a triple point, which is the endpoint of the bicritical line.

Download full-text PDF

Source
http://dx.doi.org/10.1103/PhysRevE.95.022132DOI Listing

Publication Analysis

Top Keywords

self-avoiding trails
8
bethe lattice
8
phase
6
lattice
5
grand-canonical solution
4
solution semiflexible
4
semiflexible self-avoiding
4
trails bethe
4
lattice consider
4
consider model
4

Similar Publications

Using extensive Monte Carlo simulations, we investigate the surface adsorption of self-avoiding trails on the triangular lattice with two- and three-body on-site monomer-monomer interactions. In the parameter space of two-body, three-body, and surface interaction strengths, the phase diagram displays four phases: swollen (coil), globule, crystal, and adsorbed. For small values of the surface interaction, we confirm the presence of swollen, globule, and crystal bulk phases.

View Article and Find Full Text PDF

Adsorption of interacting self-avoiding trails in two dimensions.

Phys Rev E

August 2019

School of Mathematics and Statistics, University of Melbourne, Victoria 3010, Australia.

We investigate the surface adsorption transition of interacting self-avoiding square lattice trails onto a straight boundary line. The character of this adsorption transition depends on the strength of the bulk interaction, which induces a collapse transition of the trails from a swollen to a collapsed phase, separated by a critical state. If the trail is in the critical state, the universality class of the adsorption transition changes; this is known as the special adsorption point.

View Article and Find Full Text PDF

Use of the Complex Zeros of the Partition Function to Investigate the Critical Behavior of the Generalized Interacting Self-Avoiding Trail Model.

Entropy (Basel)

February 2019

Laboratoire de Physique Théorique et Modélisation (CNRS UMR 8089), Université de Cergy-Pontoise, 2 ave A. Chauvin, 95302 Cergy-Pontoise CEDEX, France.

The complex zeros of the canonical (fixed walk-length) partition function are calculated for both the self-avoiding trails model and the vertex-interacting self-avoiding walk model, both in bulk and in the presence of an attractive surface. The finite-size behavior of the zeros is used to estimate the location of phase transitions: the collapse transition in the bulk and the adsorption transition in the presence of a surface. The bulk and surface cross-over exponents, ϕ and ϕ S , are estimated from the scaling behavior of the leading partition function zeros.

View Article and Find Full Text PDF

Optimal random search using limited spatial memory.

R Soc Open Sci

March 2018

Department of Intermedia Art and Science, School of Fundamental Science and Engineering, Waseda University, Tokyo 169-8555, Japan.

Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!