Related papers: Exact sampling of self-avoiding paths via discrete…
In this paper we provide a thorough, rigorous theoretical framework to assess optimality guarantees of sampling-based algorithms for drift control systems: systems that, loosely speaking, can not stop instantaneously due to momentum. We…
This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
The Shcramm-Loewner evolution (SLE) is a correlated exploration process, in which for the chordal set up, the tip of the trace evolves in a self-avoiding manner towards the infinity. The resulting curves are named SLE$_{\kappa}$,…
This work builds on an existing model of discrete canonical evolution and applies it to the general case of a linear dynamical system, i.e., a finite-dimensional system with configuration space isomorphic to $ \mathbb{R}^{q} $ and linear…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
We study a one parameter family of discrete Loewner evolutions driven by a random walk on the real line. We show that it converges to the stochastic Loewner evolution (SLE) under rescaling. We show that the discrete Loewner evolution…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…
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…
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…
The development of Schramm--Loewner evolution (SLE) as the scaling limits of discrete models from statistical physics makes direct simulation of SLE an important task. The most common method, suggested by Marshall and Rohde \cite{MR05}, is…
Diffusion models form an important class of generative models today, accounting for much of the state of the art in cutting edge AI research. While numerous extensions beyond image and video generation exist, few of such approaches address…
Stochastic Loewner evolution (SLE) is a differential equation driven by a one-dimensional Brownian motion (BM), whose solution gives a stochastic process of conformal transformation on the upper half complex-plane $\H$. As an evolutionary…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…
Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the…