正在加载视频...
视频加载失败
A discrete Markov chain is basically a random walk on a graph, where each outgoing edge has a fixed probability. Cool fact: any initial distribution on a sufficiently nice* Markov chain converges to its stationary distribution after many steps—because it's a contraction mapping.
0 条评论
暂无评论
原始帖子的评论将显示在这里
