scientific article; zbMATH DE number 168143
From MaRDI portal
Publication:4035994
A simple symmetric random walk in \(\mathbb{Z}^d\) is considered. The following three functionals are studied and their asymptotic behaviour is analysed: \(R_d(n)\): Largest integer for which there exists a random variable \(u\) such that all the points in the ball of radius \(R_d(n)\) centered at \(u\) are visited by time \(n\) \((d\geq 3)\). \(\nu_d(n)\): Time needed, after time \(n\), to visit a point not previously visited. \(f_n\): Cardinality of the set of ``favourite values, i.e. sites most often visited by time \(n\).
Recommendations
Cited in
(14)- Three favorite sites occurs infinitely often for one-dimensional simple random walk
- No more than three favorite sites for simple random walk
- Favorite sites of a persistent random walk
- How large a disc is covered by a random walk in \(n\) steps?
- On the behavior of random walk around heavy points
- Isomorphism theorems for Markov chains.
- scientific article; zbMATH DE number 3953992 (Why is no real title available?)
- scientific article; zbMATH DE number 4024454 (Why is no real title available?)
- scientific article; zbMATH DE number 168138 (Why is no real title available?)
- Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\)
- Mini-workshop: Geometry of random fields and random walk clusters: new horizons. Abstracts from the mini-workshop held December 8--13, 2024
- Three favorite edges occurs infinitely often for one-dimensional simple random walk
- Favorite sites for simple random walk in two and more dimensions
- The asymptotic behavior of rarely visited edges of the simple random walk
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035994)
