✦ LIBER ✦

On the entropy of a class of constrained random walks

✍ Scribed by Ido Dayan; Moshe Gitterman; George H. Weiss

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 502 KB
Volume: 183
Category: Article
ISSN: 0378-4371
DOI: 10.1016/0378-4371(92)90297-4

No coin nor oath required. For personal study only.

✦ Synopsis

We define and calculate the entropy of some random walks which have two endpoints fixed, and for which displacements are allowed to take all possible values. An example is given in which the entropy can either be increased or decreased by imposing a constraint. It is also shown, by example, that when the constrained entropy approaches its unconstrained value, the rate of approach is asymptotically (?((In n)/n).

📜 SIMILAR VOLUMES

Entropy and Dyadic Equivalence of Random

Entropy and Dyadic Equivalence of Random Walks on a Random Scenery

✍ Deborah Heicklen; Christopher Hoffman; Daniel J. Rudolph 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 192 KB

For any 1 1 measure-preserving map T of a probability space, consider the [T, T &1 ] endomorphism and the corresponding decreasing sequence of \_-algebras. We demonstrate that if the decreasing sequence of \_-algebras generated by [T, T &1 ] and [S, S &1 ] are isomorphic, then T and S must have equa

Asymptotic expansions for a remarkable c

Asymptotic expansions for a remarkable class of random walks

✍ J. Boersma; F.W. Wiegel 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 358 KB

This paper extends the research of Wiegel (J. Math. Phys. 21 (1980) 2111) on random walks which differ from free random walks through the occurrence of an extra weightfactor ( 1) at every crossing of a half-line. Starting from a new closed-form expression for the weight distribution of these walks,

On the average of a random walk

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

A note on the maximum of a random walk

✍ W. Stadje 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A theory of noise based on generalized r

A theory of noise based on generalized random walks

✍ Hiroaki Hara; Sang Don Choi; Yeon Choon Chung 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 608 KB

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