Related papers: A self-avoiding walk with attractive interactions
The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…
We have analyzed geometric and topological features of self-avoiding walks. We introduce a new kind of walk: the loop-deleted self-avoiding walk (LDSAW) motivated by the interaction of chromatin with the nuclear lamina. Its critical…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
Loop-weighted walk with parameter $\lambda\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\lambda^{k}$ if it contains $k$ loops; whether this is a…
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
We propose a new theory on a relation between diffusive and coherent nature in one dimensional wave mechanics based on a quantum walk. It is known that the quantum walk in homogeneous matrices provides the coherent property of wave…
We consider a variant of self-repelling random walk on the integer lattice Z where the self-repellence is defined in terms of the local time on oriented edges. The long-time asymptotic scaling of this walk is surprisingly different from the…
This article is dedicated to the study of the 2-dimensional interacting prudent self-avoiding walk (referred to by the acronym IPSAW) and in particular to its collapse transition. The interaction intensity is denoted by $\beta>0$ and the…
In the present paper, we consider the interacting partially-directed self-avoiding walk (IPDSAW) attracted by a vertical wall. The IPDSAW was introduced by Zwanzig and Lauritzen (J. Chem. Phys., 1968) as a manner of investigating the…
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…
We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…
We show that heterogeneity in self-propulsion speed can lead to the emergence of a robust effective short-range repulsion among active particles interacting via long-range attractive potentials. Using the example of harmonically coupled…
We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…