Related papers: A connection between the random pinning model and …
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…
In this paper, we consider the quantum walk on $\mathbb{Z}$ with attachment of one-length path periodically. This small modification to $\mathbb{Z}$ provides localization of the quantum walk. The eigenspace causing this localization is…
We consider the scaling behavior of the range and $p$-multiple range, that is the number of points visited and the number of points visited exactly $p\geq 1$ times, of simple random walk on ${\mathbb Z}^d$, for dimensions $d\geq 2$, up to…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this…
A space fractional diffusion-like equation is introduced, which embodies the nonlocality in time, represented by the memory kernel and the non-locality in space. A specific example of the nonlocal term is considered in combination with…
We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…
We present a real space renormalization group scheme for the problem of random walks in a random environment on a strip, which includes one-dimensional random walk in random environment with bounded non-nearest-neighbor jumps. We show that…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…
We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…
We propose discrete random-field models that are based on random partitions of $\mathbb{N}^2$. The covariance structure of each random field is determined by the underlying random partition. Functional central limit theorems are established…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
We introduce a diffusion model for energetically inhomogeneous systems. A random walker moves on a spin-S Ising configuration, which generates the energy landscape on the lattice through the nearest-neighbors interaction. The underlying…
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.…
Exploiting multi-dimensional quantum walks as feasible platforms for quantum computation and quantum simulation is attracting constantly growing attention from a broad experimental physics community. Here, we propose a two-dimensional…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This paper revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. It is assumed that this reflecting random walk has skip free transitions. We are concerned with its time reversed process assuming that the stationary…