Spectral analysis of communication networks using Dirichlet eigenvalues

Details Spectral analysis of communication networks using Dirichlet eigenvalues Spectral analysis of communication networks using Dirichlet eigenvalues

2011-02-17

arxiv.org/abs/1102.3722v1

Mathematics

Spectral Theory

15 pages, 4 figures

Scientific paper

We study the spectral characteristics of networks that represent the IP layer connectivity of communication systems as measured and documented by previous researchers. Our goal is to understand the behavior of these networks as truncated samples of infinite graphs. As such, the existence of a spectral gap and positive Cheeger constant in the extrapolated infinite variety would provide insight into their basic geometry. We apply Dirichlet boundary conditions to the computation of the eigenvalues to show that unlike standard spectral techniques, the gap and the Cheeger constant of finite truncations of regular trees provide accurate estimates of the corresponding parameters for the infinite tree. Having shown the effectiveness of the Dirichlet spectrum for trees, we compute spectral decompositions via Dirichlet eigenvectors for the communication networks. We show that Dirichlet eigenvectors provide a strong means to separate clusters and conclude that the said networks exhibit characteristics common in hyperbolic networks.

Affiliated with

Also associated with

No associations

Rating

Spectral analysis of communication networks using Dirichlet eigenvalues 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 Spectral analysis of communication networks using Dirichlet eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral analysis of communication networks using Dirichlet eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211033