jho*_*ick 1 python numpy python-3.x
我有这个代码:
import numpy as np
from scipy.linalg import eig
transition_mat = np.matrix([
[.95, .05, 0., 0.],\
[0., 0.9, 0.09, 0.01],\
[0., 0.05, 0.9, 0.05],\
[0.8, 0., 0.05, 0.15]])
S, U = eig(transition_mat.T)
stationary = np.array(U[:, np.where(np.abs(S - 1.) < 1e-8)[0][0]].flat)
stationary = stationary / np.sum(stationary)
>>> print stationary
[ 0.34782609 0.32608696 0.30434783 0.02173913]
Run Code Online (Sandbox Code Playgroud)
但我无法理解这一行:
stationary = np.array(U[:, np.where(np.abs(S - 1.) < 1e-8)[0][0]].flat)
Run Code Online (Sandbox Code Playgroud)
谁能解释一下这部分:U[:, np.where(np.abs(S - 1.) < 1e-8)[0][0]].flat?
我知道该例程返回S:特征值,U:特征向量。我需要找到与特征值1对应的特征向量。我写了下面的代码:
for i in range(len(S)):
if S[i] == 1.0:
j = i
matrix = np.array(U[:, j].flat)
Run Code Online (Sandbox Code Playgroud)
我得到输出:
: [ 0.6144763 0.57607153 0.53766676 0.03840477]
Run Code Online (Sandbox Code Playgroud)
但它没有给出相同的输出。为什么?!
好的,我来这篇文章是想看看是否有内置的方法来找到平稳分布。好像没有 因此,对于来自 Google 的任何人,这就是我在这种情况下找到平稳分布的方式:
import numpy as np
#note: the matrix is row stochastic.
#A markov chain transition will correspond to left multiplying by a row vector.
Q = np.array([
[.95, .05, 0., 0.],
[0., 0.9, 0.09, 0.01],
[0., 0.05, 0.9, 0.05],
[0.8, 0., 0.05, 0.15]])
#We have to transpose so that Markov transitions correspond to right multiplying by a column vector. np.linalg.eig finds right eigenvectors.
evals, evecs = np.linalg.eig(Q.T)
evec1 = evecs[:,np.isclose(evals, 1)]
#Since np.isclose will return an array, we've indexed with an array
#so we still have our 2nd axis. Get rid of it, since it's only size 1.
evec1 = evec1[:,0]
stationary = evec1 / evec1.sum()
#eigs finds complex eigenvalues and eigenvectors, so you'll want the real part.
stationary = stationary.real
Run Code Online (Sandbox Code Playgroud)
让我们把这条线分成几部分:
#Find the eigenvalues that are really close to 1.
eval_close_to_1 = np.abs(S-1.) < 1e-8
#Find the indices of the eigenvalues that are close to 1.
indices = np.where(eval_close_to_1)
#np.where acts weirdly. In this case it returns a 1-tuple with an array of size 1 in it.
the_array = indices[0]
index = the_array[0]
#Now we have the index of the eigenvector with eigenvalue 1.
stationary = U[:, index]
#For some really weird reason, the person that wrote the code
#also does this step, which is completely redundant.
#It just flattens the array, but the array is already 1-d.
stationary = np.array(stationary.flat)
Run Code Online (Sandbox Code Playgroud)
如果将所有这些代码行压缩为一行,您将得到 stationary = np.array(U[:, np.where(np.abs(S-1.)<1e-8)[0][0]].flat)
如果你删除多余的东西,你会得到 stationary = U[:, np.where(np.abs(S - 1.) < 1e-8)[0][0]]
正如@Forzaa指出的那样,您的向量不能表示概率向量,因为它的总和不为 1。如果将它除以它的总和,您将得到原始代码片段的向量。
只需添加这一行:
stationary = matrix/matrix.sum()
Run Code Online (Sandbox Code Playgroud)
然后您的平稳分布将匹配。
stationary = np.array(U[:,np.where(np.abs(S-1.) < 1e-8)[0][0]].flat)
Run Code Online (Sandbox Code Playgroud)
这段代码正在搜索U中对应特征值的元素 - 1 小于 1e-8
| 归档时间: |
|
| 查看次数: |
7642 次 |
| 最近记录: |