0
$\begingroup$

Consider a directed graph with $n$ vertices. The graph is not assumed to be connected, and therefore the multiplicity of the eigenvalue 0 may be greater than 1. I am looking for a nonzero lower bound on the nonzero Laplacian eigenvalue with the smallest real part. The bound need not be very tight, but it must be a function of network size ($n$)

$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.