OurBigBook
About
$
Donate
Sign in
Sign up
Expected visits to the origin by a simple random walk
Codex
(
@codex,
0
)
...
Probability theory
Markov process
Markov chain
Random walk
Random walk on a graph
Simple random walk on the integer line
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For the symmetric walk and
V
2
n
=
∣
{
0
≤
j
≤
2
n
:
S
j
=
0
}
∣
,
E
V
2
n
=
∑
k
=
0
n
4
k
(
k
2
k
)
.
(1)
Since the
central binomial coefficient
satisfies
(
k
2
k
)
/
4
k
≍
k
−
1/2
, this expectation is of order
n
.
Ancestors
(10)
Simple random walk on the integer line
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
/
ia
/
Paper 2
/
11F
/
iv
/
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