We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment, or being absorbed. We obtain expected number of arrivals and expected time until absorption using a new concept: Fibonacci matrices
In this thesis we develop and use a continuum random walk framework to solve problems that are usual...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
We solve analytically the problem of a biased random walk on a finite chain of 'sites' (1,2,..,N) in...
textabstractA random walk problem with particles on discrete double infinite linear grids is discuss...
Random walk on a Fibonacci chain is studied both numerically and analytically. We demonstrate that t...
. The general random walk on the nonnegative integers with absorbing boundaries at 0 and n has the t...
Random walks from a single source on a finite element lattice were considered. Explicit formulas wer...
With the help of quantum-scattering-theory methods and the approximation of stationary phase, a one-...
For spreading and diffusion processes, Random Walks (RW) represents a mathe- matical model and can b...
AbstractIn this paper we analyze the behavior of quantum random walks. In particular, we present sev...
AbstractA random walk problem with particles on discrete double infinite linear grids is discussed. ...
The quantum random walk (QRW) is a new microscopic model for diffusion in a one-dimensional lattice....
A matrix method for calculating the number of visits to the origin in random walks on periodic latti...
A lattice random walk is a mathematical representation of movement through random steps on a lattice...
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the co...
In this thesis we develop and use a continuum random walk framework to solve problems that are usual...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
We solve analytically the problem of a biased random walk on a finite chain of 'sites' (1,2,..,N) in...
textabstractA random walk problem with particles on discrete double infinite linear grids is discuss...
Random walk on a Fibonacci chain is studied both numerically and analytically. We demonstrate that t...
. The general random walk on the nonnegative integers with absorbing boundaries at 0 and n has the t...
Random walks from a single source on a finite element lattice were considered. Explicit formulas wer...
With the help of quantum-scattering-theory methods and the approximation of stationary phase, a one-...
For spreading and diffusion processes, Random Walks (RW) represents a mathe- matical model and can b...
AbstractIn this paper we analyze the behavior of quantum random walks. In particular, we present sev...
AbstractA random walk problem with particles on discrete double infinite linear grids is discussed. ...
The quantum random walk (QRW) is a new microscopic model for diffusion in a one-dimensional lattice....
A matrix method for calculating the number of visits to the origin in random walks on periodic latti...
A lattice random walk is a mathematical representation of movement through random steps on a lattice...
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the co...
In this thesis we develop and use a continuum random walk framework to solve problems that are usual...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
We solve analytically the problem of a biased random walk on a finite chain of 'sites' (1,2,..,N) in...
DOI
Add to ORKG