Related papers: Three-dimensional terminally attached self-avoidin…
We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and ``cut-and-permute'' moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot…
The aim of this survey is to explain, in a self-contained and relatively beginner-friendly manner, the lace expansion for the nearest-neighbor models of self-avoiding walk and percolation that converges in all dimensions above 6 and 9,…
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…
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…
We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…
We consider random walks X_n in Z+, obeying a detailed balance condition, with a weak drift towards the origin when X_n tends to infinity. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional…
Expressions for scaling limits of random walks, such as those obtained in several areas of the Probability theory literature, are of great significance in characterizing long term, stationary behavior of random processes. Presumably, in the…
Motivated by the results of two-dimensional conformal field theory (CFT) we investigate the finite-size scaling of the mass spectrum of an Ising model on three-dimensional lattices with a spherical cross section. Using a cluster-update…
The conformational and electronic properties of conducting flexible random and self-avoiding walk polymer chains are under investigation. A Hamiltonian for conjugated flexible polymers is introduced and its physical consequences are…
This paper shows the convergence of adele-valued random walks to an adelic L\'evy process under scaling limits. We use random walks on the $p$-adic numbers to construct random walks initially on the infinite product space, and use survival…
The coil-globule transition of an isolated polymer has been well established to be a second-order phase transition described by a standard tricritical O(0) field theory. We present Monte-Carlo simulations of interacting self-avoiding walks…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…
In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…
We consider a long-range version of self-avoiding walk in dimension $d > 2(\alpha \wedge 2)$, where $d$ denotes dimension and $\alpha$ the power-law decay exponent of the coupling function. Under appropriate scaling we prove convergence to…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…
Quantum Monte Carlo method is used to look into the superconductivity in the three-leg Hubbard ladder. The enhanced correlation for the pairing across the central and edge chains, which has been predicted in the weak-coupling…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying…