On the area of the circles covered by a random walk (Q1109422): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q106153522, #quickstatements; #temporary_batch_1711486624475 |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: The most visited site of Brownian motion and simple random walk / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3723443 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3766608 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some problems concerning the structure of random walk paths / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0047-259x(88)90123-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064831230 / rank | |||
Normal rank |
Latest revision as of 08:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the area of the circles covered by a random walk |
scientific article |
Statements
On the area of the circles covered by a random walk (English)
0 references
1988
0 references
A simply symmetric random walk on the plane is considered. Let \[ Q(N)=\{x=(i,j):\quad ||x|| = (i^2+j^2)^{1/2}\leq N\}. \] The circle \(Q(N)\) is covered by the random walk in time \(n\) if \(\xi(x,n)>0\) for every \(x\in Q(N)\) where \(\xi(x,n)\) means the number of passings through the point x during time \(n\). Let \(R(n)\) be the largest integer for which \(Q(R(n))\) is covered in \(n\). For \(R(n)\) the following lower estimate is proved: for any \(\epsilon >0\) \(R(n)\geq \exp ((\log n)^{1/2}/(\log_2n)^{3/4+\epsilon})\) a.s. for all finitely many \(n\) where \(\log_k\) is the \(k\) times iterated logarithm. An estimate is obtained for the density \(K(N,n)\) of the points of \(Q(N)\) covered by the random walk. Some further related problems are formulated.
0 references
random walk on the plane
0 references
iterated logarithm
0 references