Related papers: Quadratic Cyclic Sequences
Microscopic mechanisms of natural processes are frequently understood in terms of random walk models by analyzing local particle transitions. This is because these models properly account for dynamic processes at the molecular level and…
A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
Sinai's random walk in random environment shows interesting patterns on the exponential time scale. We characterize the patterns that appear on infinitely many time scales after appropriate rescaling (a functional law of iterated…
A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…
The Lie point symmetries of a coupled system of two nonlinear differential-difference equations are investigated. It is shown that in special cases the symmetry group can be infinite dimensional, in other cases up to 10 dimensional. The…
Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. We are interested in better understanding the…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
Quantum walks on the line with a single particle possess a classical analog. Involving more walkers opens up the possibility to study collective quantum effects, such as many particle correlations. In this context, entangled initial states…
By considering a spatial curve in a Euclidean space, we use its components, together with attaining a cyclic matrix, to show that this matrix is homothetic too and is in correspondence with a homothetic motion. Furthermore, if the curve…
In this paper, we determine an explicit formula for the number of walks in $X_n = \textsf{Cay}(\mathbb{Z}_n,\mathbb{U}_n)$, the unitary Cayley Graphs of order $n$, between any pair of its vertices. With this result, we give the number of…
Following a review of the dual description of the non-linear sigma model we investigate the one-loop quadratic divergences. We use the covariant background field method for the general case and apply the results to the important example of…
We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…
Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The…