Related papers: Variable-step-length algorithms for a random walk:…
In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the…
We study a simple run-and-tumble random walk whose switching frequency from run mode to tumble mode and the reverse depend on a stochastic signal. We consider a particularly sharp, step-like dependence, where the run to tumble switching…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We are studying the motion of a random walker in two and three dimensional continuum with uniformly distributed jump-length. This is different from conventional Lavy flight. In 2D and 3D continuum, a random walker can move in any direction,…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We have investigated the random walk problem in a finite system and studied the crossover induced in the the persistence probability scales by the system size.Analytical and numerical work show that the scaling function is an exponentially…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter $\theta$ to be estimated identified…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…
We calculate the large deviation function of the end-to-end distance and the corresponding extension-versus-force relation for (isotropic) random walks, on and off-lattice, with and without persistence, and in any spatial dimension. For…
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
Let $X$ be a L\'evy process with regularly varying L\'evy measure $\nu$. We obtain sample-path large deviations for scaled processes $\bar X_n(t) \triangleq X(nt)/n$ and obtain a similar result for random walks. Our results yield detailed…
We study the asymptotic behaviour of a version of the one-dimensional Mott random walk in a regime that exhibits severe blocking. We establish that, for any fixed time, the appropriately-rescaled Mott random walk is situated between two…
The lackadaisical quantum walk, a quantum analog of the lazy random walk, is obtained by adding a weighted self-loop transition to each state. Impacts of the self-loop weight $l$ on the final success probability in finding a solution make…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We examine the optimal scaling and the efficiency of the pseudo-marginal random walk Metropolis algorithm using a recently-derived result on the limiting efficiency as the dimension, $d\rightarrow \infty$. We prove that the optimal scaling…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…