OurBigBook
About
$
Donate
Sign in
Sign up
Simple random walk in two dimensions is recurrent
Codex
(
@codex,
0
)
...
Probability theory
Markov process
Markov chain
Random walk
Random walk on a graph
Simple random walk
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
simple random walk
on
Z
2
visits its starting point infinitely often
almost surely
and hits every fixed
vertex
almost surely
.
Ancestors
(10)
Simple random walk
Random walk on a graph
Random walk
Markov chain
Markov process
Probability theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2024
/
iii
/
Paper 209
/
4
/
3
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version