The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

Authors:
Jun Sun;Stephen Boyd;Lin Xiao;Persi Diaconis
Affiliations:
-;-;-;-
Venue:
SIAM Review
Year:
2006

Citing 0
Cited 15

Mathematical aspects of mixing times in Markov chains

Foundations and Trends® in Theoretical Computer Science
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy

Neurocomputing
Combining local and global information for nonlinear dimensionality reduction

Neurocomputing
Randomized shortest-path problems: Two related models

Neural Computation
An introduction to nonlinear dimensionality reduction by maximum variance unfolding

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Optimized stochastic policies for task allocationin swarms of robots

IEEE Transactions on Robotics
Distinguishing variance embedding

Image and Vision Computing
Query similarity by projecting the query-flow graph

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
A sum-over-paths extension of edit distances accounting for all sequence alignments

Pattern Recognition
Unsupervised feature selection for salient object detection

ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Semi-supervised learning guided by the modularity measure in complex networks

Neurocomputing
Sensor network localization by eigenvector synchronization over the euclidean group

ACM Transactions on Sensor Networks (TOSN)
A note on Fiedler vectors interpreted as graph realizations

Operations Research Letters
Semi-Supervised learning using random walk limiting probabilities

ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part II
A semi-supervised classification technique based on interacting forces

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution at a rate determined by the second smallest eigenvalue $\lambda_2$ of the Laplacian of the weighted graph. In this paper we consider the problem of assigning transition rates to the edges so as to maximize $\lambda_2$ subject to a linear constraint on the rates. This is the problem of finding the fastest mixing Markov process (FMMP) on the graph. We show that the FMMP problem is a convex optimization problem, which can in turn be expressed as a semidefinite program, and therefore effectively solved numerically. We formulate a dual of the FMMP problem and show that it has a natural geometric interpretation as a maximum variance unfolding (MVU) problem, , the problem of choosing a set of points to be as far apart as possible, measured by their variance, while respecting local distance constraints. This MVU problem is closely related to a problem recently proposed by Weinberger and Saul as a method for “unfolding” high-dimensional data that lies on a low-dimensional manifold. The duality between the FMMP and MVU problems sheds light on both problems, and allows us to characterize and, in some cases, find optimal solutions.