Related papers: Universal Amplitude Combinations for Self-Avoiding…
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…
A mapping between random walk problems and resistor network problems is described and used to calculate the effective resistance between any two nodes on an infinite two-dimensional square lattice of unit resistors. The superposition…
This is an expository paper on the asymptotic results concerning path behaviour of the anisotropic random walk on the two-dimensional square lattice Z^2. In recent years Mikl\'os and the authors of the present paper investigated the…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
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 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 consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…
We have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
This study seeks a better comprehension of anomalies by exploring (n+1)-point perturbative amplitudes in a 2n-dimensional framework. The involved structures combine axial and vector vertices into odd tensors. This configuration enables…
In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…
We study diffusion on comb lattices of arbitrary dimension. Relying on the loopless structure of these lattices and using first-passage properties, we obtain exact and explicit formulae for the Laplace transforms of the propagators…
Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…
In two dimensions polymer collapse has been shown to be complex with multiple low temperature states and multi-critical points. Recently, strong numerical evidence has been provided for a long-standing prediction of universal scaling of…
In the framework of Husimi and Bethe lattices, we investigate a generalized polymer model that incorporates as special cases different models previously studied in the literature, namely, the standard interacting self-avoiding walk, the…
We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…
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 the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…
The classical walking behaviors of a single atom in an amplitude-modulated standing wave lattice beyond the internal dynamics are investigated. Based on a simple effective model, we identify a diversity of dynamic regimes of atomic motion…