Random logistic maps. II: The critical case (Q1426849): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Hans-Jürgen Schuh / rank | |||
Property / author | |||
Property / author: Hans-Jürgen Schuh / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/b:jotp.0000011994.90898.81 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2052610874 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random logistic maps. II: The critical case |
scientific article |
Statements
Random logistic maps. II: The critical case (English)
0 references
15 March 2004
0 references
[For part I (by \textit{K. B. Athreya} and \textit{J. Dai}) see ibid. 13, No. 2, 595--608 (2000; Zbl 0969.60069).] The authors study iterations of i.i.d. random logistic maps of the interval which generate a Markov chain on the interval. If the expectation of logarithm of the parameter is zero (called the critical case), it was shown before that the Markov chain converges in probability to zero. The authors show that in spite of this the Markov chain does not converge to zero with probability one. Moreover, with probability one the Markov chain exceeds certain fixed positive valued infinitely many times.
0 references
random logistic maps
0 references
critical case
0 references
absorption time
0 references
Backgammon model
0 references
contingency table problem
0 references