Related papers: Fractality and Topology of Self-Avoiding Walks
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…
We study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent, and the number of rooted open walks W_n(S), and rooted…
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 study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
Understanding the geodesic properties of fractal aggregates is essential, as their thermal and mechanical properties are characterized by their geodesics. In this study, we investigate the root mean square (RMS) of the geodesic between two…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$ to that of terminally-attached…
We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…
A signed network represents how a set of nodes are connected by two logically contradictory types of links: positive and negative links. In a signed products network, two products can be complementary (purchased together) or substitutable…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
Stability and diversity are two key properties that living entities share with spin glasses, where they are manifested through the breaking of the phase space into many valleys or local minima connected by saddle points. The topology of the…
The scaling behavior of linear polymers in disordered media modelled by self-avoiding random walks (SAWs) on the backbone of two- and three-dimensional percolation clusters at their critical concentrations p_c is studied. All possible SAW…
CSAW (conditioned self-avoiding walk) is a model of protein folding that combines SAW (self-avoiding walk) with Monte-Carlo. It simulates the Brownian motion of a chain molecule in the presence of interactions, both among chain residues,…
The self-avoiding walk, and lattice spin systems such as the $\varphi^4$ model, are models of interest both in mathematics and in physics. Many of their important mathematical problems remain unsolved, particularly those involving critical…
Self-repelling two-leg (biped) spider walk is considered where the local stochastic movements are governed by two independent control parameters $ \beta_d$ and $ \beta_h $, so that the former controls the distance ($ d $) between the legs…
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
We consider a random walk on one-dimensional inhomogeneous graphs built from Cantor fractals. Our study is motivated by recent experiments that demonstrated superdiffusion of light in complex disordered materials, thereby termed L\'evy…
The morphology of defects formed in collision cascades is an essential aspect of the subsequent evolution of the microstructure. The morphological composition of a defect decides its stability, interaction, and migration properties. We…
Folklore has, that the universal scaling properties of linear polymers in disordered media are well described by the statistics of self-avoiding walks Folklore has, that the universal scaling properties of linear polymers in disordered…