VUKADINOVIC, D., HUANG,P.,AND ERLEBACH, T. A Spectral Analysis of the Internet Topology. Tech. rep., ETH Zurich, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....coefficients [46] Their work proposes an alternative degree based generator that more closely matches the clustering behavior of the measured AS graph. For completeness, we have incorporated both the clustering metric and the proposed generator in our analyses (Section 4) Vukadinovic et al. [45] evaluate the Laplacian eigenvalue spectrum of a variety of graphs, and conclude that the multiplicity of eigenvalues of value 1 differentiates AS graphs from grids and random trees. However, as claimed in [45] this measure of the spectrum reflects purely local properties of the graph (the number ....

....metric and the proposed generator in our analyses (Section 4) Vukadinovic et al. 45] evaluate the Laplacian eigenvalue spectrum of a variety of graphs, and conclude that the multiplicity of eigenvalues of value 1 differentiates AS graphs from grids and random trees. However, as claimed in [45], this measure of the spectrum reflects purely local properties of the graph (the number of degree 1 nodes, the number of nodes attached to degree 1 nodes etc. while our work focuses on the large scale structure. However, their result is consistent with our findings (and with the commonly held ....

VUKADINOVIC, D., HUANG, P., AND ERLEBACH, T. A Spectral Analysis of the Internet Topology. Tech. rep., ETH Zurich, 2001.

....and AS graph are very di#erent. At a minimum, the identification of these formulations will be useful. A second possibility is that the router and AS level graphs are more di#erent than similar, but that the standard metrics used to assess network similarity are not the right ones (e.g. see [30, 31]) 3.3 A Piece of a Bigger Puzzle The Internet serves as ideal starting point for a scientific exploration of the broader issues of robustness in complex systems, partularly those throughout engineering and biology. In most of these systems, complexity is driven by the need for robustness to ....

D. Vukadinovic, P. Huang, and T. Erlebach. A spectral analysis of the Internet topology. ETH TIK-NR. 118, 2001.

....coefficients [47] Their work proposes an alternative degree based generator that more closely matches the clustering behavior of the measured AS graph. For completeness, we have incorporated both the clustering metric and the proposed generator in our analyses (Section 4) Vukadinovic et al. [46] evaluate the Laplacian eigenvalue spectrum of a variety of graphs, and conclude that the multiplicity of eigenvalues of value 1 differentiates AS graphs from grids and random trees. However, as claimed in [46] this measure of the spectrum reflects purely local properties of the graph (the number ....

....metric and the proposed generator in our analyses (Section 4) Vukadinovic et al. 46] evaluate the Laplacian eigenvalue spectrum of a variety of graphs, and conclude that the multiplicity of eigenvalues of value 1 differentiates AS graphs from grids and random trees. However, as claimed in [46], this measure of the spectrum reflects purely local properties of the graph (the number of degree 1 nodes, the number of nodes attached to degree 1 nodes etc. while our work focuses on the large scale structure. However, their result is consistent with our findings (and with the commonly held ....

D. Vukadinovic, P. Huang, and T. Erlebach. A Spectral Analysis of the Internet Topology. Technical report, ETH Zurich, 2001.

No context found.

VUKADINOVIC, D., HUANG,P.,AND ERLEBACH, T. A Spectral Analysis of the Internet Topology. Tech. rep., ETH Zurich, 2001.

No context found.

D. Vukadinovic, P. Huang, and T. Erlebach. A Spectral Analysis of the Internet Topology. Technical report, ETH Zurich, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC