A Unified Framework for the Evaluation of Complex Networks

Article Preview

Abstract:

Graph metrics are important tools for the comparisons between networks. However, different graph metrics may lead to different evaluation results for a certain network. In this paper, we generate a unified framework for the multi-metrics and study the collective evaluation method for complex networks with multi-metrics. Finally, the experimental analysis verifies the correctness and practical values of the proposed method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1473-1476

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] GR-QC collaboration network. http: /snap. stanford. edu/data/ca-GrQc. html.

Google Scholar

[2] Biological network. http: /en. wikipedia. org/wiki/Biological_network.

Google Scholar

[3] Cvetkovic D. Spectral recognition of graphs. Yugoslav Journal of Operations Research, 2012, 22(2): 145-161.

Google Scholar

[4] Bader D A, Madduri K. SNAP, Small-world Network Analysis and Partitioning: an open-source parallel graph framework for the exploration of large-scale networks, 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, April 14-18, (2008).

DOI: 10.1109/ipdps.2008.4536261

Google Scholar

[5] Xu X K, Zhang J, Smal M. Rich-club connectivity dominates assortativity and transitivity of complex networks, Physical Review E, 2010, 82: 046117.

DOI: 10.1103/physreve.82.046117

Google Scholar

[6] Cetinkaya E K, Alenazi M J F, Peck A M, Rohrer J P, Sterbenz J P G. Multilevel resilience analysis of transportation and communication networks [J]. Telecommunication Systems, (2013).

DOI: 10.1007/s11235-015-9991-y

Google Scholar

[7] Barabasi A L, Albert R. Emergence of scaling in random networks. Science. 1999, 286(5439): 509-512.

DOI: 10.1126/science.286.5439.509

Google Scholar

[8] Bu T, Towsley D. On distinguishing between Internet power law topology generators. Proceed- ings of IEEE Infocom 2002, New York, NY, Jun, (2002).

Google Scholar

[9] Haddadi H, Fay D, Uhlig S, Moore A, Mortier R, Jamakovic A, Rio M. Tuning topology generators using spectral distributions. In SPEC Int. Perform. Eval. Workshop, Darmstadt, Germany, Lecture Notes in Computer Science, 2008, 5119: 154-173.

DOI: 10.1007/978-3-540-69814-2_11

Google Scholar

[10] Leskovec J, Faloutsos C. Sampling from large graphs. In: Proc. of the 12th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 2006. 631-636.

DOI: 10.1145/1150402.1150479

Google Scholar

[11] Stumpf M P H, Wiuf C, May R M. Subnets of scale-free networks are not scale-free: Sampling properties of networks. In PNAS, 102, (2005).

DOI: 10.1073/pnas.0501179102

Google Scholar

[12] Krishnamurthy V, Faloutsos M, Chrobak M, Lao L, Cui J H, Percus A G. Reducing large internet topologies for faster simulations. In Networking, (2005).

DOI: 10.1007/11422778_27

Google Scholar