Random walks on trees and the law of iterated logarithm
type: Item
instance of: scholarly article
title: Random walks on trees and the law of iterated logarithm
zbMATH Open document ID: 1007.60035
DOI: 10.1016/S0167-7152(01)00185-7
author: Mokhtar Konsowa
published in: Statistics \& Probability Letters
publication date: 2002-09-05T00:00:00Z
review text: 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.
reviewed by: Mihai Gradinaru
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 60F99
zbMATH DE Number: 1796678
zbMATH Keywords: random walks
zbMATH Keywords: infinite trees
zbMATH Keywords: law of iterated logarithm
MaRDI profile type: Publication
cites work: Q4183968
cites work: The type problem for random walks on trees
cites work: Q4715818
cites work: Q3281447
Wikidata QID: Q126471587
description: scientific article; zbMATH DE number 1796678