Related papers: Windings of planar random walks and averaged Dehn …
We study the winding behavior of random walks on two oriented square lattices. One common feature of these walks is that they are bound to revolve clockwise. We also obtain quantitative results of transience/recurrence for each walk.
We study the convex hull of the first $n$ steps of a planar random walk, and present large-$n$ asymptotic results on its perimeter length $L_n$, diameter $D_n$, and shape. In the case where the walk has a non-zero mean drift, we show that…
We employ a simple and accurate dimensional interpolation formula for the shapes of random walks at $D=3$ and $D=2$ based on the analytically known solutions at both limits $D=\infty$ and $D=1$. The results obtained for the radii of…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
We study a one-dimensional random walk whose expected drift depends both on time and the position of a particle. We establish a non-trivial phase transition for the recurrence vs. transience of the walk, and show some interesting…
We find uniform lower bounds on the drift for a large family of random walks on graph products, of the form $ \mathbb{P} (|Z_{n}| \leq \kappa n) \leq e ^{-\kappa n} $ for $ \kappa > 0 $. This includes the simple random walk for a…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…
We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, we define a local slope at each point and gauge the function…
We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…
Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…
We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…
We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
By introducing an invariant of loops on a compact oriented surface with one boundary component, we give an explicit formula for the action of Dehn twists on the completed group ring of the fundamental group of the surface. This invariant…
Let $S_k$ be a random walk in $R^d$ such that its distribution of increments does not assign mass to hyperplanes. We study the probability $p_n$ that the convex hull $conv (S_1, \ldots , S_n)$ of the first $n$ steps of the walk does not…
We estimate the expected value of certain function $f:\{-1,1\}^{n}\to\mathbb{R}$. For example, with computer assistance, we show that if $\Delta$ is the Laplacian of the Cayley graph of…
We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…