Visualize Networks with K-Core Decomposition
LaNet-vi: Large Networks Visualization
Upload your network data and create beautiful, hierarchical visualizations that reveal the core structure of complex networks.
What is a k-core?
Peel the network
Repeatedly remove every node with fewer than k neighbors. What survives is the k-core: a subgraph where every node has at least k neighbors inside it. A node's core number is the largest k whose core still contains it, so the decomposition sorts all nodes from the periphery (1) to the innermost core.
Read the picture
LaNet-vi places nodes on concentric shells by core number, the innermost core at the center; inside a shell, a node sits closer to the center the higher its neighbors' core numbers. Color runs from magenta (outer shells) to red (the maximum core), and node size grows with degree.
Why it helps
It shows the hierarchy of a network with millions of edges in one image and in linear time. In the Internet AS graph the innermost core holds the large transit and content networks; I am here shows where your own network sits.
Method: J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat and A. Vespignani, k-core decomposition: a tool for the visualization of large scale networks (NIPS 2005). The gallery methodology lists the exact rendering parameters.
Upload Your Network Data
Edge List Format
Your file should contain one edge per line with node IDs separated by spaces or tabs:
1 2
2 3
3 4
1 4
With weights (optional):
1 2 0.5
2 3 1.2
3 4 0.8
Your Visualization
Why LaNet-vi?
K-Core Decomposition
Reveals hierarchical structure from cores to periphery.
Publication-Ready
High-quality images with circular layouts.
High Performance
Handle networks with millions of nodes.