Convex Optimization of Graph Laplacian Eigenvalues Export

@article{citeulike:2782859, author = {Boyd}, citeulike-article-id = {2782859}, citeulike-linkout-0 = {http://www.stanford.edu/~boyd/papers/cvx_opt_graph_lapl_eigs.html}, comment = {discusses the problem of choosing edge weights of an undirected graph to max/min some function. shows the relation to markov-chains, algebraic-connectivity, linear averaging and least steady state mean square deviation (like linear averaging but with noise)}, keywords = {algebric-connectivity, effective-resistance, fastest-linear-averaging, least-steady-state-mean-square-deviation, markov-chain, social-networks}, posted-at = {2008-05-10 14:23:09}, priority = {2}, title = {Convex Optimization of Graph Laplacian Eigenvalues}, url = {http://www.stanford.edu/~boyd/papers/cvx_opt_graph_lapl_eigs.html} }

TY - JOUR ID - citeulike:2782859 L3 - citeulike-article-id:2782859 TI - Convex Optimization of Graph Laplacian Eigenvalues KW - algebric-connectivity KW - effective-resistance KW - fastest-linear-averaging KW - least-steady-state-mean-square-deviation KW - markov-chain KW - social-networks N1 - discusses the problem of choosing edge weights of an undirected graph to max/min some function. shows the relation to markov-chains, algebraic-connectivity, linear averaging and least steady state mean square deviation (like linear averaging but with noise) AU - Boyd UR - http://www.stanford.edu/~boyd/papers/cvx_opt_graph_lapl_eigs.html ER -