๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Random vicious walks and random matrices

โœ Scribed by Jinho Baik

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
155 KB
Volume
53
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Random walks and cell size
Random walks and cell size
โœ Paul S. Agutter; Denys N. Wheatley ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB ๐Ÿ‘ 1 views
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