Related papers: Random walks and quadratic number fields
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…
Random walks simulate the randomness of objects, and are key instruments in various fields such as computer science, biology and physics. The counter part of classical random walks in quantum mechanics are the quantum walks. Quantum walk…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
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.…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We establish some relations between the spectra of simple and non-backtracking random walks on non-regular graphs, generalizing some well-known facts for regular graphs. Our two main results are 1) a quantitative relation between the mixing…
We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about…
We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…
Discrete time random walks, in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$, are widely used models for stochastic processes. In the case of a correlated random walk, the next…
Annealed functional CLT in the rough path topology is proved for the standard class of ballistic random walks in random environment. Moreover, the `area anomaly', i.e. a deterministic linear correction for the second level iterated integral…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…
We show that quantum walks interpolate between a coherent `wave walk' and a random walk depending on how strongly the walker's coin state is measured; i.e., the quantum walk exhibits the quintessentially quantum property of complementarity,…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
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…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We investigated the discrete-time quantum random walks on a line in periodic potential. The probability distribution with periodic potential is more complex compared to the normal quantum walks, and the standard deviation $\sigma$ has…
We study the behavior of the Riemann zeta function on the critical line when the imaginary part of the argument is sampled by the Cauchy random walk. We develop a complete second order theory for the corresponding system of random variables…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…