𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random walks and cell size

✍ Scribed by Paul S. Agutter; Denys N. Wheatley

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
98 KB
Volume
22
Category
Article
ISSN
0265-9247

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks and the regeneration time
Random walks and the regeneration time
✍ Beveridge, Andrew; LovοΏ½sz, LοΏ½szlοΏ½ πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 218 KB πŸ‘ 1 views

Consider a graph G and a random walk on it. We want to stop the random walk at certain times (using an optimal stopping rule) to obtain independent samples from a given distribution ρ on the nodes. For an undirected graph, the expected time between consecutive samples is maximized by a distribution

Dependent percolation and colliding rand
Dependent percolation and colliding random walks
✍ Peter Winkler πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 2 views

Let G be a connected, undirected graph and Let N N be the nonnegative quadrant of the plane grid, and H the subgraph of N N induced by the sites i j for which X i = Y j . We say that G is "navigable" if with probability greater than 0, the origin belongs to an infinite component of H. We determine

Matrix-valued SzegΕ‘ polynomials and quan
Matrix-valued SzegΕ‘ polynomials and quantum random walks
✍ M. J. Cantero; L. Moral; F. Alberto GrΓΌnbaum; L. VelΓ‘zquez πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 332 KB

## Abstract We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes and to give results that are analogous to those