Large scale networks fingerprinting and visualization using the k-core decomposition

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 41-50

  Alvarez Hamelin, J Ignacio ^a,c   Dall'Asta, Luca ^a   Barrat, Alain ^a   Vespignani, Alessandro ^b  

^a UNIVERSITÉ PARIS SUD   (France)

^b INDIANA UNIVERSITY   (United States)

^c UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL CORE; COMPLEX NETWORKS; HIERARCHICAL STRUCTURES; LARGE-SCALE NETWORK; LOW COMPUTATIONAL COMPLEXITY; SPARSE NETWORK; VISUALIZATION ALGORITHMS; VISUALIZATION TOOLS;

ALGORITHMS; STRUCTURAL PROPERTIES;

VISUALIZATION;

EID: 84864040903     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," Rev. Mod. Phys. 74, pp. 47-97, 2000.
2. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks: From biological nets to the Internet and WWW, Oxford University Press, 2003.
3. R. Pastor-Satorras and A. Vespignani, Evolution and structure of the Internet: A statistical physics approach, Cambridge University Press, 2004.
4. V. Batagelj and M. Zaversnik, "Generalized Cores," cs.DS/0202039, 2002.
5. LArge NETwork VIsualization tool. http://xavier.informatics.indiana.edu/ lanet-vi/.
6. http://http://i11www.ira.uka.de/cosin/tools/index.php.
7. V. Batagelj, A. Mrvar, and M. Zaversnik, "Partitioning Approach to Visualization of Large Networks," in Graph Drawing '99, Castle Stirin, Czech Republic, LNCS 1731, pp. 90-98, 1999.
8. M. Baur, U. Brandes, M. Gaertler, and D.Wagner, "Drawing the AS Graph in 2.5 Dimensions," in "12th International Symposium on Graph Drawing, Springer-Verlag editor", pp. 43-48, 2004.
9. U. Brandes and S. Cornelsen, "Visual Ranking of Link Structures," Journal of Graph Algorithms and Applications 7(2), pp. 181-201, 2003.
10. B. Shneiderman, "Why not make interfaces better than 3d reality?," IEEE Computer Graphics and Applications 23, pp. 12-15, November/December 2003.
11. G. D. Bader and C. W. V. Hogue, "An automated method for finding molecular complexes in large protein interaction networks," BMC Bioinformatics 4(2), 2003.
12. M. Altaf-Ul-Amin, K. Nishikata, T. Koma, T. Miyasato, Y. Shinbo, M. Arifuzzaman, C. Wada, M. Maeda, T. Oshima, H. Mori, and S. Kanaya, "Prediction of Protein Functions Based on K-Cores of Protein-Protein Interaction Networks and Amino Acid Sequences," Genome Informatics 14, pp. 498-499, 2003.
13. S.Wuchty and E. Almaas, "Peeling the Yeast protein network," Proteomics. 2005 Feb;5(2):444-9.
14. M. Gaertler and M. Patrignani, "Dynamic Analysis of the Autonomous System Graph," in IPS 2004, International Workshop on Inter-domain Performance and Simulation, Budapest, Hungary, pp. 13-24, 2004.
15. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani, "k-core decomposition: a tool for the analysis of large scale internet graphs," cs.NI/0511007 .
16. S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir, 2005. http://www.cs.huji.ac.il/~kirk/Jellyfish-Dimes.ppt.
17. S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir, "Medusa - new model of internet topology using k-shell decomposition," cond-mat/0601240 .
18. V. Batagelj and M. Zaversnik, "An O(m) Algorithm for Cores Decomposition of Networks," cs.DS/0310049, 2003.
19. University of Oregon Route Views Project. http://www.routeviews.org/.
20. R. Govindan and H. Tangmunarunkit, "Heuristics for Internet Map Discovery," in IEEE INFOCOM 2000, pp. 1371-1380, IEEE, (Tel Aviv, Israel), March 2000.