Sciweavers

Share
IJMMS
2007

Visualization of large networks with min-cut plots, A-plots and R-MAT

8 years 7 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier detection (terrorist networks, or illegal money-laundering rings), forecasting, and simulations (“how will a computer virus spread?”). The heart of the problem is finding the properties of real graphs that seem to persist over multiple disciplines. We list such patterns and “laws”, including the “min-cut plots” discovered by us. This is the first part of our NetMine package: given any large graph, it provides visual feedback about these patterns; any significant deviations from the expected patterns can thus be immediately flagged by the user as abnormalities in the graph. The second part of NetMine is the A-plots tool for visualizing the adjacency matrix of the graph in innovative new ways, again to find outliers. Third, NetMine contains the R-MAT (Recursive MATrix) graph generato...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IJMMS
Authors Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan
Comments (0)
books