The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
From MaRDI portal
Publication:3427459
DOI10.1137/S0036144504443821zbMath1109.60324OpenAlexW2083412275MaRDI QIDQ3427459
No author found.
Publication date: 20 March 2007
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036144504443821
Computational learning theory (68Q32) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Semidefinite programming (90C22) Continuous-time Markov processes on general state spaces (60J25) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Connectedness of users-items networks and recommender systems, Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction, The rotational dimension of a graph, Matrix Relaxations in Combinatorial Optimization, The bundle scheme for solving arbitrary eigenvalue optimizations, Eigen-stratified models, Finding graph embeddings by incremental low-rank semidefinite programming, Disturbance attenuation of a network of nonlinear systems, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data, Randomized Shortest-Path Problems: Two Related Models, Spectrally optimized pointset configurations, Comparison inequalities and fastest-mixing Markov chains, Accelerating distributed average consensus by exploring the information of second-order neighbors, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials, Consensus of linear network systems diffusively coupled with exogenous disturbances: An ℋ∞ approach, Geometric bounds on the fastest mixing Markov chain, A sum-over-paths extension of edit distances accounting for all sequence alignments, Synchronization of coupled limit cycles, Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler, Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian, Comparison of Metric Spectral Gaps, Unnamed Item, Application and analysis of multicast blocking modelling in fat-tree data center networks, Mean curvature, threshold dynamics, and phase field theory on finite graphs, A note on Fiedler vectors interpreted as graph realizations, Enhancing sparsity by reweighted \(\ell _{1}\) minimization, Subsampling Algorithms for Semidefinite Programming, Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
