✦ LIBER ✦

An iterative approximation procedure for the distribution of the maximum of a random walk

✍ Scribed by Wolfgang Stadje

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 127 KB
Volume: 50
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(00)00124-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the maximum of a random walk

✍ W. Stadje 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A computational procedure for the approx

A computational procedure for the approximation of random functions

✍ William H. Ling; Harry W. McLaughlin; Mary Lynn Smith 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 219 KB

The Law of the Iterated Logarithm for Fi

The Law of the Iterated Logarithm for Finitely Inhomogeneous Random Walks

✍ Aurel Spătaru 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 370 KB

A constant arising from the analysis of

A constant arising from the analysis of algorithms for determining the maximum of a random walk

✍ Hsien-Kuei Hwang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

We give a closed-form expression for a complicated constant arising in the average-case analysis of maximum-finding algorithms for a random walk.

A finite dimensional approximation of th

A finite dimensional approximation of the effective diffusivity for a symmetric random walk in a random environment

✍ Małgorzata Cudna; Tomasz Komorowski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We consider a nearest neighbor, symmetric random walk on a homogeneous, ergodic random lattice Z d . The jump rates of the walk are independent, identically Bernoulli distributed random variables indexed by the bonds of the lattice. A standard result from the homogenization theory, see [A. De Masi,

The distribution of the maximum degree o

The distribution of the maximum degree of a random graph

✍ Béla Bollobás 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Consider I:andom graphs with n labelled vertices in which the edges are chosen independently and with a 6lxed probability p, 0 <p C 1. Let y be a fixed real number, q = 1p, and denote by A the maximum degree. Then