Results 251 to 260 of about 1,809,097 (279)
Some of the next articles are maybe not open access.
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
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
Science, 1987
A theoretical description of the shape of a random object is presented that is analytically simple in application but quantitatively accurate. The asymmetry of the object is characterized in terms of the invariants of a tensor, analogous to the moment-of-inertia tensor, whose eigenvalues are the squares of the principal radii of gyration ...
J, Rudnick, G, Gaspari
openaire +2 more sources
A theoretical description of the shape of a random object is presented that is analytically simple in application but quantitatively accurate. The asymmetry of the object is characterized in terms of the invariants of a tensor, analogous to the moment-of-inertia tensor, whose eigenvalues are the squares of the principal radii of gyration ...
J, Rudnick, G, Gaspari
openaire +2 more sources
Random Walks And Random Environments
1995Abstract 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
2005
Random walks or Brownian motions appear as a useful tool in algorithm analysis. Recently P. Flajolet ([2]) obtained a complete and detailed analysis of the two stacks problem with the help of properties of simple random walks on lattices. G. Louchard ([7], [8]) proved that the Brownian motion permits to give easily asymptotic results on the complexity ...
openaire +1 more source
Random walks or Brownian motions appear as a useful tool in algorithm analysis. Recently P. Flajolet ([2]) obtained a complete and detailed analysis of the two stacks problem with the help of properties of simple random walks on lattices. G. Louchard ([7], [8]) proved that the Brownian motion permits to give easily asymptotic results on the complexity ...
openaire +1 more source
Random Walks: A Review of Algorithms and Applications
IEEE Transactions on Emerging Topics in Computational Intelligence, 2020Jiaying Liu, Xiangjie Kong, Hansong Nie
exaly