Pages that link to "Item:Q3427459"
From MaRDI portal
The following pages link to The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem (Q3427459):
Displaying 30 items.
- Connectedness of users-items networks and recommender systems (Q279972) (← links)
- Disturbance attenuation of a network of nonlinear systems (Q327869) (← links)
- Comparison inequalities and fastest-mixing Markov chains (Q373832) (← links)
- Accelerating distributed average consensus by exploring the information of second-order neighbors (Q415068) (← links)
- A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
- Synchronization of coupled limit cycles (Q639866) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Application and analysis of multicast blocking modelling in fat-tree data center networks (Q680832) (← links)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization (Q734955) (← links)
- Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials'' (Q900457) (← links)
- A note on Fiedler vectors interpreted as graph realizations (Q991473) (← links)
- Eigen-stratified models (Q2138309) (← links)
- Mean curvature, threshold dynamics, and phase field theory on finite graphs (Q2254953) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- Spectrally optimized pointset configurations (Q2402876) (← links)
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler (Q2455515) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- The rotational dimension of a graph (Q3168659) (← links)
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
- Finding graph embeddings by incremental low-rank semidefinite programming (Q3458829) (← links)
- (Q5053241) (← links)
- A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data (Q5070506) (← links)
- Subsampling Algorithms for Semidefinite Programming (Q5168846) (← links)
- Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs (Q5268000) (← links)
- Randomized Shortest-Path Problems: Two Related Models (Q5323768) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
- Consensus of linear network systems diffusively coupled with exogenous disturbances: An <i>ℋ</i><sub><i>∞</i></sub> approach (Q6152787) (← links)
- Geometric bounds on the fastest mixing Markov chain (Q6193769) (← links)