Related papers: Exact sampling of self-avoiding paths via discrete…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…
We show that the classical Rosenbluth method for sampling self-avoiding walks can be extended to a general algorithm for sampling many families of objects, including self-avoiding polygons. The implementation relies on an elementary move…
We propose a novel multiple-scale spatial marching method for flows with slow streamwise variation. The key idea is to couple the boundary region equations, which govern large-scale flow evolution, with local exact coherent structures that…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
We study the large scale behaviour of a population consisting of two types which evolve in dimension d = 1, 2 according to a spatial Lambda- Fleming-Viot process subject to random time-independent selection. If one of the two types is rare…
This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction…
Path planning is a classic problem for autonomous robots. To ensure safe and efficient point-to-point navigation an appropriate algorithm should be chosen keeping the robot's dimensions and its classification in mind. Autonomous robots use…
The natural paramterization or length for the Schramm-Loewner evolution (SLE{\kappa}) is the candidate for the scaling limit of the length of discrete curves for \kappa < 8. We improve the proof of the existence of the parametrization and…
Sampling-based algorithms solve the path planning problem by generating random samples in the search-space and incrementally growing a connectivity graph or a tree. Conventionally, the sampling strategy used in these algorithms is biased…
The aim of this paper is to present a result of discrete approximation of some class of stable self-similar stationary increments processes. The properties of such processes were intensively investigated, but little is known on the context…
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…
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…
Trajectory planning for mobile robots in cluttered environments remains a major challenge due to narrow passages, where conventional methods often fail or generate suboptimal paths. To address this issue, we propose the adaptive trajectory…
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 consider how to directly extract a road map (also known as a topological representation) of an initially-unknown 2-dimensional environment via an online procedure that robustly computes a retraction of its boundaries. In this article, we…
We consider high order approximations of the solution of the stochastic filtering problem, derive their pathwise representation in the spirit of the earlier work of Clark and Davis and prove their robustness property. In particular, we show…
We introduce a new lattice growth model, which we call boundary sandpile. The model amounts to potential-theoretic redistribution of a given initial mass on $\mathbb{Z}^d$ ($d\geq 2$) onto the boundary of an (a priori) unknown domain. The…