Relative complexity of random walks in random scenery in the absence of a weak invariance principle for the local times (Q2406568)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Relative complexity of random walks in random scenery in the absence of a weak invariance principle for the local times
scientific article

    Statements

    Relative complexity of random walks in random scenery in the absence of a weak invariance principle for the local times (English)
    0 references
    0 references
    0 references
    5 October 2017
    0 references
    The authors consider random walks in random scenarios driven by the simple random walk in \(\mathbb Z^2\), by aperiodic recurrent \(\mathbb Z^2\)-valued random walks with finite variance and by an aperiodic recurrent integer-valued random walk in the domain of attraction of the Cauchy distribution. Aaronson's question about the relative complexity of the random walks is answered. One of main tasks is to prove that the range of the random walk satisfies the Fölner property almost surely.
    0 references
    random walk
    0 references
    complexity
    0 references
    entropy
    0 references
    Fölner sequence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references