搜索结果: 1-3 共查到“管理科学与工程 Graphs”相关记录3条 . 查询时间(0.109 秒)
Mixing Times for Random Walks on Geometric Random Graphs
Mixing Times Random Walks Geometric Random Graphs
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
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...
Network Lasso: Clustering and Optimization in Large Graphs
Convex Optimization ADMM Network Lasso
2015/7/8
Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, general convex optimiza...