Approximating the largest eigenvalue of network adjacency matrices

Details Approximating the largest eigenvalue of network adjacency matrices Approximating the largest eigenvalue of network adjacency matrices

2007-05-31

arxiv.org/abs/0705.4503v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

7 pages, 4 figures

Scientific paper

10.1103/PhysRevE.76.056119

The largest eigenvalue of the adjacency matrix of a network plays an important role in several network processes (e.g., synchronization of oscillators, percolation on directed networks, linear stability of equilibria of network coupled systems, etc.). In this paper we develop approximations to the largest eigenvalue of adjacency matrices and discuss the relationships between these approximations. Numerical experiments on simulated networks are used to test our results.

Affiliated with

Also associated with

No associations

Rating

Approximating the largest eigenvalue of network adjacency matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating the largest eigenvalue of network adjacency matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the largest eigenvalue of network adjacency matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-288462