✦ LIBER ✦

Duality properties of a one-dimensional random walk and a new computational algorithm

✍ Scribed by C.B. Winsten; M.J. Fryer

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 597 KB
Volume: 44
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(90)90252-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Monte Carlo study of a random walk on

A Monte Carlo study of a random walk on a two-dimensional random network

✍ T.M. John; G. Ananthakrishna 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Random walk on a one-dimensional random

Random walk on a one-dimensional random lattice: Equivalence between bond disorder and site disorder models

✍ C. Aslangul; N. Pottier; D. Saint-James 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Some properties of a random walk on a co

Some properties of a random walk on a comb structure

✍ George H. Weiss; Shlomo Havlin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Analytic study of the effect of persiste

Analytic study of the effect of persistence on a one-dimensional biased random walk

✍ Noëlle Pottier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 636 KB

A new algorithm for three-dimensional ti

A new algorithm for three-dimensional tidal and storm surge computations

✍ R.W Lardner; H.M Cekirge 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 821 KB

Entropy and Dyadic Equivalence of Random

Entropy and Dyadic Equivalence of Random Walks on a Random Scenery

✍ Deborah Heicklen; Christopher Hoffman; Daniel J. Rudolph 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 192 KB

For any 1 1 measure-preserving map T of a probability space, consider the [T, T &1 ] endomorphism and the corresponding decreasing sequence of \_-algebras. We demonstrate that if the decreasing sequence of \_-algebras generated by [T, T &1 ] and [S, S &1 ] are isomorphic, then T and S must have equa