开始的时候没有思路,但是把蚂蚁前进看作+1,后退看作-1 以为跟卡特兰数有关。也是拼命的变换。毫无进展。 不过转换一下思路,考虑枚举状态转移,令P[k,t]
P
[
k
,
t
]
表示走t步到达k节点的概率。 那么 P[k,t]
P
[
k
,
t
]
与P[k±1,t′]
P
[
k
±
1
,
t
′
]
有关。那么写出所有的转移:
P[1,t]=12P[2,t−1]P[2,t]=P[1,t−1]+12P[3,t−1]P[3,t]=12(P[2,t−1]+P[4,t−1])P[4,t]=12P(3,t−1)P[5,t]=12p(4,t−1)
P
[
1
,
t
]
=
1
2
P
[
2
,
t
−
1
]
P
[
2
,
t
]
=
P
[
1
,
t
−
1
]
+
1
2
P
[
3
,
t
−
1
]
P
[
3
,
t
]
=
1
2
(
P
[
2
,
t
−
1
]
+
P
[
4
,
t
−
1
]
)
P
[
4
,
t
]
=
1
2
P
(
3
,
t
−
1
)
P
[
5
,
t
]
=
1
2
p
(
4
,
t
−
1
)
显然可以矩阵地推。 配合快速幂,计算近似值并不难:
⎡⎣⎢⎢⎢⎢⎢⎢010000.500.50000.500.50000.500.500000⎤⎦⎥⎥⎥⎥⎥⎥⎡⎣⎢⎢⎢⎢⎢⎢P[1,t−1]P[2,t−1]P[3,t−1]P[4,t−1]P[5,t−1]⎤⎦⎥⎥⎥⎥⎥⎥=⎡⎣⎢⎢⎢⎢⎢⎢P[1,t]P[2,t]P[3,t]P[4,t]P[5,t]⎤⎦⎥⎥⎥⎥⎥⎥
[
0
0.5
0
0
0
1
0
0.5
0
0
0
0.5
0
0.5
0
0
0
0.5
0
0
0
0
0
0.5
0
]
[
P
[
1
,
t
−
1
]
P
[
2
,
t
−
1
]
P
[
3
,
t
−
1
]
P
[
4
,
t
−
1
]
P
[
5
,
t
−
1
]
]
=
[
P
[
1
,
t
]
P
[
2
,
t
]
P
[
3
,
t
]
P
[
4
,
t
]
P
[
5
,
t
]
]
(∑k>=0Akk)⎡⎣⎢⎢⎢⎢⎢⎢P[1,0]P[2,0]P[3,0]P[4,0]P[5,0]⎤⎦⎥⎥⎥⎥⎥⎥=(∑k>=0Akk)⎡⎣⎢⎢⎢⎢⎢⎢10000⎤⎦⎥⎥⎥⎥⎥⎥
(
∑
k
>=
0
A
k
k
)
[
P
[
1
,
0
]
P
[
2
,
0
]
P
[
3
,
0
]
P
[
4
,
0
]
P
[
5
,
0
]
]
=
(
∑
k
>=
0
A
k
k
)
[
1
0
0
0
0
]
(∑k>=0Akk)=(∑k>=0P−BkPk)=P−(∑k>=0Bkk)P
(
∑
k
>=
0
A
k
k
)
=
(
∑
k
>=
0
P
−
B
k
P
k
)
=
P
−
(
∑
k
>=
0
B
k
k
)
P
进一步:
∑k>=0Bkk=⎡⎣⎢⎢⎢⎢⎢⎢⎢∑λk1k00000∑λk2k00000∑λk3k00000∑λk4k00000∑λk5k⎤⎦⎥⎥⎥⎥⎥⎥⎥
∑
k
>=
0
B
k
k
=
[
∑
λ
1
k
k
0
0
0
0
0
∑
λ
2
k
k
0
0
0
0
0
∑
λ
3
k
k
0
0
0
0
0
∑
λ
4
k
k
0
0
0
0
0
∑
λ
5
k
k
]
对于这个和式:
∑k>=0λkk=limn−>∞∑k=0nλkk
∑
k
>=
0
λ
k
k
=
lim
n
−
>
∞
∑
k
=
0
n
λ
k
k
(1−λ)∑k=0nλkk=∑k=0nλkk−∑k=0nλk+1k=∑k=0nλkk−∑k=1n+1λk(k−1)=∑k=1nλk−λn+1n=λ−λn+11−λ−λn+1n
(
1
−
λ
)
∑
k
=
0
n
λ
k
k
=
∑
k
=
0
n
λ
k
k
−
∑
k
=
0
n
λ
k
+
1
k
=
∑
k
=
0
n
λ
k
k
−
∑
k
=
1
n
+
1
λ
k
(
k
−
1
)
=
∑
k
=
1
n
λ
k
−
λ
n
+
1
n
=
λ
−
λ
n
+
1
1
−
λ
−
λ
n
+
1
n
则:
∑k=0nλkk=λ−λn+1(1−λ)2−λn+1n1−λ
∑
k
=
0
n
λ
k
k
=
λ
−
λ
n
+
1
(
1
−
λ
)
2
−
λ
n
+
1
n
1
−
λ
由于
|λ|<1
|
λ
|
<
1
则:
∑k>=0λkk=limn−>∞∑k=0nλkk=limn−>∞λ−λn+1(1−λ)2−λn+1n1−λ=λ(1−λ)2
∑
k
>=
0
λ
k
k
=
lim
n
−
>
∞
∑
k
=
0
n
λ
k
k
=
lim
n
−
>
∞
λ
−
λ
n
+
1
(
1
−
λ
)
2
−
λ
n
+
1
n
1
−
λ
=
λ
(
1
−
λ
)
2