Comparison of network criticality, algebraic connectivity, and other graph metrics

SIMPLEX'09 - 1st Annual Workshop on Simplifying Complex Network for Practitioners

Volumn , Issue , 2009, Pages

  Bigdeli, Alireza ^a   Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Graph spectrum; Graph theory; Network robustness

Indexed keywords

ALGEBRAIC CONNECTIVITY; AVERAGE DEGREE; BETWEENNESS; COMPLEX NETWORKS; CONNECTIVITY PROPERTIES; GRAPH SPECTRA; GRAPH SPECTRUM; NETWORK ANALYSIS; NETWORK CRITICALITY; NETWORK ROBUSTNESS; NETWORK TOPOLOGY; NODE DEGREE;

ALGEBRA; COBALT COMPOUNDS; CRITICALITY (NUCLEAR FISSION); ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY;

COMPUTER SIMULATION;

EID: 73949159585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1610304.1610308     Document Type: Conference Paper

References (12)

1. A. H. Dekker and B. Colberet. The Symmetry Ratio of a Network. In Australasian symposium on Theory of computing, volume 41, pages 13-20, Newcastle, Australia, 2005. ACM International Conference Proceeding Series.
2. A. H. Dekker and B. D. Colbert. Network Robustness and Graph Topology. Australasian Computer Science Conference, 26:359-368, Jan. 2004.
3. M. Fiedler. Algebraic Connectivity of Graphs. Czechoslovak Math. Journal, 23(98):298-305, 1973.
4. A. Ghosh, S. Boyd, and A. Saberi. Minimizing Effective Resistance of a Graph. SIAM Review, problems and techniques section, 50(1):37-66, February 2008.
5. A. Jamakovic and P. V. Mieghem. On the Robustness of Complex Networks by Using the Algebraic Connectivity . In NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, pages 183-194. Springer Berlin/Heidelberg, May 2008.
6. A. Jamakovic and S. Uhlig. On the Relationship between the Algebraic Connectivity and Graph Robustness to Node and Link Failures. In 3rd EuroNGI Conference, On Next Generation Internet Networks, pages 96-102, Trondheim, May 2007.
7. M. Newman. A Measure of Betweenness Centrality Based on Random Walks. arXiv cond-mat/0309045., 2003.
8. A. Tizghadam. Autonomic Core Network Management System. Phd thesis, University of Toronto, School of Electrical and Computer Engineering, April 2009.
9. A. Tizghadam and A. Leon-Garcia. A Robust Routing Plan to Optimize Throughput in Core Networks. ITC20, Elsvier, pages 117-128, 2007.
10. A. Tizghadam and A. Leon-Garcia. On Robust Traffic Engineering in Core Networks. In IEEE GLOBECOM, December 2008.
11. A. Tizghadam and A. Leon-Garcia. Survival Value of Communication Networks. Infocom Workshop on Network Science for Communications (NetSciCom), April 2009.
12. D. Watts and S. Strogatz. Collective Dynamics of Small-World Networks. Nature, (393):440-442, 1999.