✦ LIBER ✦

On the Riemann hypothesis: A fractal random walk approach

✍ Scribed by Michael F. Shlesinger

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 532 KB
Volume: 138
Category: Article
ISSN: 0378-4371
DOI: 10.1016/0378-4371(86)90187-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks of a particle on fractal la

Random walks of a particle on fractal lattices with traps

✍ R. Rammal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Piecewise directed random walk on the Si

Piecewise directed random walk on the Sierpinski gasket family of fractals

✍ S. Elezović-Hadžić; S. Milošević 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Exact renormalization group treatment of

Exact renormalization group treatment of the piecewise directed random walks on fractals

✍ S. Elezović-Hadžić; S. Milošević; H.W. Capel; G.L. Wiersma 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 843 KB

On the average of a random walk

✍ Karl Grill 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A branched chain on a branched chain app

A branched chain on a branched chain approach to fractal random flights

✍ Marcel Ovidiu Vlad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Static and Dynamic Path Selection on Exp

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach

✍ Andrei Z. Broder; Alan M. Frieze; Eli Upfal 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

This paper addresses the problem of virtual circuit switching in bounded degree expander graphs. We study the static and dynamic versions of this problem. Our solutions are based on the rapidly mixing properties of random walks on expander graphs. In the static version of the problem an algorithm is