Entropy of Random Walk Range
نویسندگان
چکیده
We study the entropy of the set traced by an n-step simple symmetric random walk on Z. We show that for d ≥ 3, the entropy is of order n. For d = 2, the entropy is of order n/ log n. These values are essentially governed by the size of the boundary of the trace.
منابع مشابه
Localization of the maximal entropy random walk.
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk loca...
متن کاملMaximal-entropy random walk unifies centrality measures
This paper compares a number of centrality measures and several (dis-)similarity matrices with which they can be defined. These matrices, which are used among others in community detection methods, represent quantities connected to enumeration of paths on a graph and to random walks. Relationships between some of these matrices are derived in the paper. These relationships are inherited by the ...
متن کاملRandom Entropy and Recurrence
1. Motivation and introduction. In [1], the concept of random entropy associated with a Zd random group action was introduced and studied. Every such Zd random group action is generated via a cocycle. (For the readers with a probabilistic background, a cocycle is a generalization of an ordinary random walk, the main difference being the fact that cocycles are generally indexed by Zd rather than...
متن کاملErgodic theory on stationary random graphs
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random graphs of subexponential growth are almost surely Liouville, that is, admit no non constant bounded harmonic functions. Applications include the uniform infinite ...
متن کاملRandom Walk Null Models for Time Series Data
Permutation entropy has become a standard tool for time series analysis that exploits the temporal and ordinal relationships within data. Motivated by a Kullback–Leibler divergence interpretation of permutation entropy as divergence from white noise, we extend pattern-based methods to the setting of random walk data. We analyze random walk null models for correlated time series and describe a m...
متن کامل