Related papers: Some remarks on the lonely runner conjecture

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Let $\{X_n\}_{n\in\mathbb{N}}$ be a sequence of i.i.d. random variables in $\mathbb{Z}^d$. Let $S_k=X_1+...+X_k$ and $Y_n(t)$ be the continuous process on $[0,1]$ for which $Y_n(k/n)=S_k/\sqrt{n}$ $k=1,...,n$ and which is linearly…

We consider the random conductance model in a stationary and ergodic environment. Under suitable moment conditions on the conductances and their inverse, we prove a quenched invariance principle for the random walk among the random…

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a functions of its summands as their number tends to infinity. The conditioning event is of moderate or…

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

We prove that a planar random walk with bounded increments and mean zero which is conditioned to stay in a cone converges weakly to the corresponding Brownian meander if and only if the tail distribution of the exit time from the cone is…

We show that a coupling of non-colliding simple random walkers on the complete graph on $n$ vertices can include at most $n - \log n$ walkers. This improves the only previously known upper bound of $n-2$ due to Angel, Holroyd, Martin,…

We show that the classical Kac's random walk on $(n-1)$-sphere $S^{n-1}$ starting from the point mass at $e_1$ mixes in $\mathcal{O}(n^5(\log n)^3)$ steps in total variation distance. The main argument uses a truncation of the running…

We consider a simple random walk (dimension one, nearest neighbour jumps) in a quenched random environment. The goal of this work is to provide sufficient conditions, stated in terms of properties of the environment, under which the Central…

We consider a random walk $(Z^{(1)}_n, ..., Z^{(K+1)}_n) \in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. In this paper, we show that this random walk is slowed down by a…

Consider the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter $p$ and finite time horizon $n$. Allaart \cite{Allaart} proved that the optimal strategy…

We prove strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. It is also shown that their local times are close enough to…

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

For positive integers $\alpha$ and $\beta$, we define an $(\alpha,\beta)$-walk to be any sequence of positive integers satisfying $w_{k+2}=\alpha w_{k+1}+\beta w_k$. We say that an $(\alpha,\beta)$-walk is $n$-slow if $w_s=n$ with $s$ as…

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…

We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…