By Topic

Visualizing graphs with Krylov subspaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Alex Breuer ; Army Research Laboratory, APG, MD 21005, USA

Visualizing large graphs is a difficult problem, and requires balancing of the need to express global structure and the need to preserve local detail. The commute-time embedding is an attractive choice for providing a geometric embedding for graph vertices, but is high-dimensional. Dimension reduction of the commute-time embedding may be accomplished with Krylov subspace methods, which can preserve local detail and have intuitive geometric interpretations. These reduced-dimension approximations are computationally inexpensive, and may be contrasted against the much more expensive application of principal components analysis dimension reduction.

Published in:

Network Science Workshop (NSW), 2011 IEEE

Date of Conference:

22-24 June 2011