9
votes
1answer
311 views

Coherence between different ranking methods of a graph's vertices

Given a (connected) graph $G$ it is natural to want to rank its vertices, with the more "central" vertices ranked higher. Two natural ways of doing it are: By the degrees. By the entries in a ...
2
votes
0answers
111 views

Optimization over Spectral Laplacian in cycles and trees

Is there any idea on how one can deal with an optimization problem of sum of k largest eigenvalues(min) of Laplacian matrix of a simple cycle or tree? I would like to use semidefinite programming for ...
0
votes
0answers
266 views

Orthogonal Projections in Lie Theory

I have been studying a finite element method where rigid & elastic spatial motions are separated using an orthogonal projection (actually two: one for translations/stretches, the other for ...