Computer Science – Networking and Internet Architecture
Scientific paper
2005-04-28
Advances in Neural Information Processing Systems 18, Canada (2006) 41
Computer Science
Networking and Internet Architecture
Scientific paper
We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively focusing on their central cores. By using this strategy we develop a general visualization algorithm that can be used to compare the structural properties of various networks and highlight their hierarchical structure. The low computational complexity of the algorithm, O(n+e), where 'n' is the size of the network, and 'e' is the number of edges, makes it suitable for the visualization of very large sparse networks. We apply the proposed visualization tool to several real and synthetic graphs, showing its utility in finding specific structural fingerprints of computer generated and real world networks.
Alvarez-Hamelin José Ignacio
Barrat Alain
Dall'Asta Luca
Vespignani Alessandro
No associations
LandOfFree
k-core decomposition: a tool for the visualization of large scale networks 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 k-core decomposition: a tool for the visualization of large scale networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-core decomposition: a tool for the visualization of large scale networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-715232