Fastest mixing Markov chain on graphs with symmetries

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 eigenvalue modulus of the transition probability matrix). Exploiting symmetry can lead to significant reduction in both the number of variables and the size of matrices in the corresponding semidefinite program, thus enable numerical solution of large-scale instances that are otherwise computationally infeasible. We obtain analytic or semi-analytic results for particular classes of graphs, such as edge-transitive and distance-transitive graphs. We describe two general approaches for symmetry exploitation, based on orbit theory and block-diagonalization, respectively. We also establish the connection between these two approaches.Comment: 39 pages, 15 figure

Invariant higher-order variational problems II

Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution curves known as Riemannian cubics on object manifolds that are endowed with normal metrics. The prime examples of such object manifolds are the symmetric spaces. We characterize the class of cubics on object manifolds that can be lifted horizontally to cubics on the group of transformations. Conversely, we show that certain types of non-horizontal geodesics on the group of transformations project to cubics. Finally, we apply second-order Lagrange--Poincar\'e reduction to the problem of Riemannian cubics on the group of transformations. This leads to a reduced form of the equations that reveals the obstruction for the projection of a cubic on a transformation group to again be a cubic on its object manifold.Comment: 40 pages, 1 figure. First version -- comments welcome