Related papers: Efficient Random Walk Algorithm for Simulating The…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
Thermal transport in classical fluids is analyzed in terms of a Higher-Order Generalized Hydrodynamics (or Mesoscopic Hydro-Thermodynamics), that is, depending on the evolution of the energy density and its fluxes of all orders. It is…
We study the asymptotic behaviour of random walks in i.i.d. random environments on $\Z^d$. The environments need not be elliptic, so some steps may not be available to the random walker. We prove a monotonicity result for the velocity (when…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
In this article we present an effective Hamiltonian approach for Discrete Time Quantum Random Walk. A form of the Hamiltonian for one dimensional quantum walk has been prescribed, utilizing the fact that Hamiltonians are the generators of…
We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
Current digital computers are about to hit basic physical boundaries with respect to integration density, clock frequencies, and particularly energy consumption. This requires the application of new computing paradigms, such as quantum and…
We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
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 study a $d$-dimensional random walk with exponentially distributed increments conditioned so that the components stay ordered (in the sense of Doob). We find explicitly a positive harmonic function $h$ for the killed process and then…
Thermodynamics of trajectories promises to make possible the thorough analysis of the dynamical properties of an open quantum system, a sought-after goal in modern physics. Unfortunately, calculation of the relevant quantities presents…
We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm -- a quantum algorithm solving systems of linear equations -- in solving an open problem about quantum random walks, namely computing hitting (or absorption)…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.