Random walks on trees and the law of iterated logarithm (Q1612989): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126471587, #quickstatements; #temporary_batch_1719280132499 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126471587 / rank | |||
Normal rank | |||
Latest revision as of 02:53, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random walks on trees and the law of iterated logarithm |
scientific article |
Statements
Random walks on trees and the law of iterated logarithm (English)
0 references
5 September 2002
0 references
Kolmogorov's law of iterated logarithm is used to provide conditions [see also \textit{M. Konsowa} and \textit{J. Mitro}, J. Theor. Probab. 4, No. 3, 535-550 (1991; Zbl 0725.60073)] for the recurrence or transience of a simple random walk on (infinite) \(\mathbb N\)-trees in which all vertices with the same distance from the root have the same degree.
0 references
random walks
0 references
infinite trees
0 references
law of iterated logarithm
0 references
