Simple random walk on the line in random environment (Q1062355): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tail behavior of sums of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lower limits of maxima and minima of wiener process and partial sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the law of the iterated logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localization of random walks in one-dimensional random environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong law for the maximum cumulative sum of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks in a random environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An invariance principle for the law of the iterated logarithm / rank
 
Normal rank

Revision as of 18:37, 14 June 2024

scientific article
Language Label Description Also known as
English
Simple random walk on the line in random environment
scientific article

    Statements

    Simple random walk on the line in random environment (English)
    0 references
    0 references
    0 references
    1986
    0 references
    We obtain strong limiting bounds for the maximal excursion and for the maximum reached by a random walk in a random environment. Our results derive from a simple proof of Pólya's theorem for the recurrence of the random walk on the line. As applications, we obtain bounds for the number of visits of the random walk at the origin.
    0 references
    random walk in a random environment
    0 references
    transience
    0 references
    recurrence
    0 references
    local time
    0 references
    law of the iterated logarithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references