搜索结果: 1-3 共查到“管理科学与工程 Mixing”相关记录3条 . 查询时间(0.13 秒)
Fastest Mixing Markov Chain on a Graph
Markov chains second largest eigenvalue modulus fast mixing
font style='font-size:12px;'>
2015/7/10
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equ...
Mixing Times for Random Walks on Geometric Random Graphs
Mixing Times Random Walks Geometric Random Graphs
font style='font-size:12px;'>
2015/7/10
A geometric random graph, G^d(n,r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each oth...
Fastest Mixing Markov Chain on Graphs with Symmetries
Markov chains fast mixing eigenvalue optimization semidefi nite programming
font style='font-size:12px;'>
2015/7/9
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...