This repository has been archived by the owner on Jun 23, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 20
Spectral radius #147
Labels
Comments
pinging @taddallas (just FYI) |
Wait, @taddallas, this needs your input. Spectral radius depends heavily on the size of the matrix. So it seems to me that we should have some process to make it more standard. The two I can think of are either dividing by the sum of the absolute values of the real part of the eigenvalues, or to divide by the norm of the adjacency matrix, since it should be an upper bound for the spectral radius in most cases. |
I'll go ahead and use the norm at the moment. |
tpoisot
added a commit
that referenced
this issue
Oct 16, 2019
(also sipping Laphroaig so code may be bad)
Let's close this one and have the discussion in the PR instead. |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add the spectral radius function - this is defined for any unipartite network, so bipartite networks simply need to be converted.
The text was updated successfully, but these errors were encountered: