𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The buikding blocks of random walks

✍ Scribed by Yuval Gefen; Isaac Goldhirsch


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
500 KB
Volume
38
Category
Article
ISSN
0167-2789

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Shape asymmetry of star-branched random
✍ Gerhard Zifferer πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 534 KB

## Abstract Star‐branched random walks with 3, 4, 6, 8 and 12 arms (the total chain‐length ranging from __N__ = 49 to 1925) have been produced and analysed with respect to their instantaneous shape. The short‐chain behaviour of nonreversal random walk stars (NRRWs) embedded in various lattices is c

The random generation of underdiagonal w
✍ E. Barcucci; R. Pinzani; R. Sprugnoli πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 626 KB

In this paper, we propose an algorithm for the random generation of underdiagonal walks. We consider the plane walks which are made up of different kinds of east, north-east and north steps and which start from the origin and remain under the main diagonal. The algorithm is very simple: it randomly

Windings of planar random walks
✍ Claude J.P. BΓ©lisle πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 58 KB
Random walks and the regeneration time
✍ Beveridge, Andrew; LovοΏ½sz, LοΏ½szlοΏ½ πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 218 KB πŸ‘ 2 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

Return statistics of simple random walks
✍ Peter Kirschenhofer; Helmut Prodinger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 298 KB