Skip to content
This repository has been archived by the owner on Jun 23, 2023. It is now read-only.

Spectral radius #147

Closed
tpoisot opened this issue Oct 16, 2019 · 4 comments
Closed

Spectral radius #147

tpoisot opened this issue Oct 16, 2019 · 4 comments

Comments

@tpoisot
Copy link
Member

tpoisot commented Oct 16, 2019

Add the spectral radius function - this is defined for any unipartite network, so bipartite networks simply need to be converted.

@tpoisot
Copy link
Member Author

tpoisot commented Oct 16, 2019

pinging @taddallas (just FYI)

tpoisot added a commit that referenced this issue Oct 16, 2019
@tpoisot
Copy link
Member Author

tpoisot commented Oct 16, 2019

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.

@tpoisot
Copy link
Member Author

tpoisot commented Oct 16, 2019

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)
@tpoisot
Copy link
Member Author

tpoisot commented Oct 16, 2019

Let's close this one and have the discussion in the PR instead.

@tpoisot tpoisot closed this as completed Oct 16, 2019
@tpoisot tpoisot mentioned this issue Oct 16, 2019
7 tasks
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

1 participant