Related papers: Simulating Simple Random Walks With a Deck of Card…

Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the…

In this note, we design a discrete random walk on the real line which takes steps $0, \pm 1$ (and one with steps in $\{\pm 1, 2\}$) where at least $96\%$ of the signs are $\pm 1$ in expectation, and which has $\mathcal{N}(0,1)$ as a…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

We study the convergence rate of translation-invariant discrete-time quantum dynamics on a one-dimensional lattice. We prove that the cumulative distributions function of the ballistically scaled position $X(n)/{n}$ after $n$ steps…

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…

We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities…

A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…

We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and…

Let $X$ be a simple random walk on $\mathbb{Z}_n^d$ with $d\geq 3$ and let $t_{\rm{cov}}$ be the expected cover time. We consider the set of points $\mathcal{U}_\alpha$ of $\mathbb{Z}_n^d$ that have not been visited by the walk by time…

We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…

We analyze Jim Propp's P-machine, a simple deterministic process that simulates a random walk on $Z^d$ to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful…

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

We consider the problem of high-dimensional Gaussian graphical model selection. We identify a set of graphs for which an efficient estimation algorithm exists, and this algorithm is based on thresholding of empirical conditional…

We consider a random walk on top of the contact process on $\mathbb{Z}^d$ with $d\geq 1$. In particular, we focus on the "contact process as seen from the random walk". Under the assumption that the infection rate of the contact process is…