Related papers: Interacting partially directed self-avoiding walk:…
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…
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…
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on…
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…
We introduce branching annihilating attracting walk (BAAW) in one dimension. The attracting walk is implemented by a biased hopping in such a way that a particle prefers hopping to a nearest neighbor located on the side where the nearest…
It has been recently argued that interacting self-avoiding walks (ISAW) of length $ \ell , $ in their low temperature phase (i.e. below the $ \Theta $-point) should have a partition function of the form: $$ Q_{\ell} \sim \mu^{ \ell}_ 0\mu^{…
We show numerically that critical exponents for two-point interchain correlation of an infinite chain characterize those of finite chains in Self-Avoiding Walk (SAW) and Self-Avoiding Polygon (SAP) under a topological constraint. We…
We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
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 show that the `erasing-larger-loops-first' (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpinski gasket, does work also for non-Markov random walks, in particular, self-repelling walks…
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…
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 a family of one-dimensional self interacting walks whose dynamics characterized by a monotone weight function $w$ on $\mathbb{N}\cup \{0\}$. The weight function takes the form $w(n) = (1 + 2^p Bn^{-p} + O(n^{-1-\kappa}))^{-1}$,…
We demonstrate that the recently proposed Interacting Growth Walk (cond-mat/0108097) does not have the contact-scaling behaviour of Self-Avoiding Walk (M. Baiesi, E. Orlandini and A. L. Stella, Phys. Rev. Lett. 87, 070602 (2001)) at finite…
Contrasting marginal counterfactual survival curves across treatment arms is an effective and popular approach for inferring the causal effect of an intervention on a right-censored time-to-event outcome. A key challenge to drawing such…
We study the thermodynamics of an exactly solvable model of a self-interacting partially directed self-avoiding walk (DSAW) in two dimensions, when a force is applied on one end of the chain. The critical force for the unfolding is…
This thesis explores a central question: how does memory affect the way random walkers explore space? By analyzing various non-Markovian models, where past behavior directly influences future dynamics, we uncover new mechanisms and…
We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…
We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…
Self-interacting random walks (SIRWs) show long-range memory effects that result from the interaction of the random walker at time $t$ with the territory already visited at earlier times $t'<t$. This class of non-Markovian random walks has…