搜索结果: 1-2 共查到“计算数学 mixing”相关记录2条 . 查询时间(0.1 秒)
Fastest mixing Markov chain on graphs with symmetries
Markov chains fast mixing eigenvalue optimization semidefi nite programming graph automorphism group representation
2015/8/10
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest ei...
On weak mixing, minimality and weak disjointness of all iterates
transitive set weakly mixing set topological entropy
2010/12/3
Given a continuous map f , we study the recurrence properties of f (∗m) = f × f 2 × . . . × f m. In contrast to minimal case, we show that in general there is no relation between topological wea...