Generally, it is not easy to find the exact tail-estimation for the distribution of the minimum value in partial sum sequence of a stationary ergodic Markov chain.
一般情况下对平稳遍历马尔可夫链部分和序列最小值分布进行精确尾估计是较困难的。
2
Put forward a planner permutation network by using the ergodic and good relativity of Chebyshev-map chaos sequence, and the time complexity and analyzed permutation character of permutation network.