or distributed averaging" by L. Xiao and S. Boyd</span>
<span class="comment">% "Fastest mixing Markov chain on a graph" by S. Boyd, P. Diaconis, and L. Xiao</span>
<span class="comment">% "Convex Optimization of Graph Laplacian Eigenvalues" by S. Boyd</span>
<span class="comment">%</span>
<span class="comment">% Almir Mutapcic 08/29/06</span>

<span class="comment">% degrees of the nodes</span>
[n,m] = size(A);
Lunw = A*A';          <span class="comment">% unweighted Laplacian matrix</span>
degs = diag(Lun