Related papers: Simulating self-avoiding walks in bounded domains

The question of whether biological populations survive or are eventually driven to extinction has long been examined using mathematical models. In this work we study population survival or extinction using a stochastic, discrete…

Suppose that a $d$-dimensional domain is filled with a gas of (in general, interacting) diffusive particles with density $n_0$. A particle is absorbed whenever it reaches the domain boundary. Employing macroscopic fluctuation theory, we…

The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…

Driven single-file motion, in which particles move unidirectionally along one-dimensional channels, sets the paradigm for wide variety of one-dimensional directed movements, ranging from intracellular transport and urban traffic to ant…

In this paper we study generative modeling via autoencoders while using the elegant geometric properties of the optimal transport (OT) problem and the Wasserstein distances. We introduce Sliced-Wasserstein Autoencoders (SWAE), which are…

The myopic (or `true') self-avoiding walk model (MSAW) was introduced in the physics literature by Amit, Parisi and Peliti (1983). It is a random motion in Z^d pushed towards domains less visited in the past by a kind of negative gradient…

We examine the optimal scaling and the efficiency of the pseudo-marginal random walk Metropolis algorithm using a recently-derived result on the limiting efficiency as the dimension, $d\rightarrow \infty$. We prove that the optimal scaling…

We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…

We consider a generalization of the classical pinning problem for integer-valued random walks conditioned to stay non-negative. More specifically, we take pinning potentials of the form $\sum_{j\geq 0}\epsilon_j N_j$, where $N_j$ is the…

We consider a matrix branching random walk on the semi-group of nonnegative matrices, where we are able to derive, under general assumptions, an analogue of Biggins' martingale convergence theorem for the additive martingale $W_n$, a spinal…

We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…

We study a random walk on the Lie algebra $\mathfrak{sl}_2(\mathbf{F}_p)$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we…

We prove that the scaling limit of loop-erased random walk in a simply connected domain $D$ is equal to the radial SLE(2) path in $D$. In particular, the limit exists and is conformally invariant. It follows that the scaling limit of the…

Sliced Wasserstein (SW) distances offer an efficient method for comparing high-dimensional probability measures by projecting them onto multiple 1-dimensional probability distributions. However, identifying informative slicing directions…

This paper explores the use of the standard approach for proving runtime bounds in discrete domains---often referred to as drift analysis---in the context of optimization on a continuous domain. Using this framework we analyze the (1+1)…

The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to an efficient binary tree implementation of the pivot…

Anomalous diffusion processes, in particular superdiffusive ones, are known to be efficient strategies for searching and navigation by animals and also in human mobility. One way to create such regimes are L\'evy flights, where the walkers…

We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…

One-parameter family of discrete-time quantum-walk models on the square lattice, which includes the Grover-walk model as a special case, is analytically studied. Convergence in the long-time limit $t \to \infty$ of all joint moments of two…

Higher-order proximity preserved network embedding has attracted increasing attention. In particular, due to the superior scalability, random-walk-based network embedding has also been well developed, which could efficiently explore…