𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A measure of the symmetry of random walks

✍ Scribed by George H. Weiss; Haim Weissman

Publisher
Springer
Year
1988
Tongue
English
Weight
283 KB
Volume
52
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A measure of betweenness centrality base
A measure of betweenness centrality based on random walks
✍ M.E. J. Newman πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 399 KB

Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths between node pairs that pass through the node of interest. Betweenness is, in some sense, a measure of the influence a node has over the spread of information through the n

The measurement of β€œsinuosity” in correl
The measurement of β€œsinuosity” in correlated random walks
✍ Brian Williams πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 339 KB

Many animals appear to move according to a correlated random walk, that is to say, on a sufficiently fine time scale the direction of successive steps will be in approximately the same but on a sufficiently coarse time scale the direction of successive steps will be randomly distributed around a cir

Shape asymmetry of star-branched random
Shape asymmetry of star-branched random walks and nonreversal random walks
✍ 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
The random generation of underdiagonal walks
✍ 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

The buikding blocks of random walks
The buikding blocks of random walks
✍ Yuval Gefen; Isaac Goldhirsch πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 500 KB