Related papers: Exponents of interchain correlation for self-avoid…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
In this review paper, we first discuss some open problems related to two-dimensional self-avoiding paths and critical percolation. We then review some closely related results (joint work with Greg Lawler and Oded Schramm) on critical…
Consider a compact metric space $S$ and a pair $(j,k)$ with $k \ge 2$ and $1 \le j \le k$. For any probability distribution $\theta \in P(S)$, define a Markov chain on $S$ by: from state $s$, take $k$ i.i.d. ($\theta$) samples, and jump to…
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…
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…
We consider random self-avoiding walks between two points on the boundary of a finite subdomain of Z^d (the probability of a self-avoiding trajectory gamma is proportional to mu^{-length(gamma)}). We show that the random trajectory becomes…
We present a mathematical proof of theoretical predictions made by Arguin and Saint-Aubin, as well as by Bauer, Bernard, and Kytola, about certain non-local observables for the two-dimensional Ising model at criticality by combining…
The critical adsorption point (CAP) of self-avoiding walks (SAW) interacting with a planar surface with surface disorder or sequence disorder has been studied. We present theoretical equations, based on ones previously developed by Soteros…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…
We consider a model of semi-flexible interacting self-avoiding trails (sISAT's) 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…
We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…
A lattice model of the directed self-avoiding walk is used to estimate the possibility on the formation of an infinitely long linear semi-flexible copolymer chain. The copolymer chain is assumed to composed of four different types of the…
Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant…
It was discovered a few years ago that many networks in the real world exhibit self-similarity. A lot of researches on the structures and processes on real and artificial fractal complex networks have been done, drawing an analogy to…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…
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 present Monte Carlo simulations of semidilute solutions of long self-attracting chain polymers near their Ising type critical point. The polymers are modeled as monodisperse self-avoiding walks on the simple cubic lattice with attraction…