Results 241 to 250 of about 251,555 (277)
Some of the next articles are maybe not open access.

Random walk on a random walk

Physica A: Statistical Mechanics and its Applications, 1982
The authors investigate the random walk of a particle on a one-dimensional chain which has been constructed by a random-walk procedure. Exact expressions are given for the mean-square displacement and the fourth moment after n steps. The probability density after n steps is derived in the saddle-point approximation, for large n.
K.W. Kehr, R. Kutner
openaire   +1 more source

Delayed random walks

Physical Review E, 1995
The fluctuations about the stable point in a delayed dynamical system are modeled as a delayed random walk: i.e., a random walk in which the transition probability depends on the position of the walker at a time \ensuremath{\tau} in the past and transitions in the direction of the stable point are more probable.
, Ohira, , Milton
openaire   +2 more sources

Quantum random walks

Physical Review A, 1993
We introduce the concept of quantum random walk, and show that due to quantum interference effects the average path length can be much larger than the maximum allowed path in the corresponding classical random walk. A quantum-optics application is described.
, Aharonov, , Davidovich, , Zagury
openaire   +2 more sources

Rational Random Walks

The Review of Economic Studies, 1993
Summary: The paper examines, within the framework of a multi-dimensional one-step forward-looking model, a special category of rational expectations equilibria. Their support is infinite with two accumulation points (steady states); the stochastic motion of the system is of random-walk type.
Chiappori, Pierre-AndrĂ©   +1 more
openaire   +1 more source

CASCADING RANDOM WALKS

International Journal of Foundations of Computer Science, 2005
In this paper, we discuss a simple, Monte Carlo algorithm for the problem of checking whether a Quantified Boolean Formula (QBF) in Conjunctive Normal Form (CNF), with at most two literals per clause has a model. The term k-CNF is used to describe boolean formulas in CNF, with at most k literals per clause and the problem of checking whether a given k ...
openaire   +2 more sources

Brownian Random Walk

Journal of Mathematical Sciences, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Random walk in random groups

Geometric and Functional Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Random Walks And Random Environments

1995
Abstract This is the first volume of a two-volume work devoted to probability theory in physics, physical chemistry and engineering. This volume provides an introduction to the problem of "random walk" and its applications. In its simplest form, the random walk describes the motion of an idealized drunkard and is a discrete analogue of ...
openaire   +1 more source

Home - About - Disclaimer - Privacy