Finding structures in large-scale graphs

Sang Peter Chin; Elizabeth Reilly; Linyuan Lu

doi:10.1117/12.978069

6 July 2012 Finding structures in large-scale graphs

Sang Peter Chin, Elizabeth Reilly, Linyuan Lu

Proceedings Volume 8408, Cyber Sensing 2012; 840805 (2012) https://doi.org/10.1117/12.978069
Event: SPIE Defense, Security, and Sensing, 2012, Baltimore, Maryland, United States

Abstract

One of the most vexing challenges of working with graphical structures is that most algorithms scale poorly as the graph becomes very large. The computation is extremely expensive even for polynomial algorithms, thus making it desirable to devise fast approximation algorithms. We herein propose a framework using advanced tools ^1-6 from random graph theory and spectral graph theory to address the quantitative analysis of the structure and dynamics of large-scale networks. This framework enables one to carry out analytic computations of observable network structures and capture the most relevant and refined quantities of realworld networks.

Citation Download Citation

Sang Peter Chin, Elizabeth Reilly, and Linyuan Lu "Finding structures in large-scale graphs", Proc. SPIE 8408, Cyber Sensing 2012, 840805 (6 July 2012); https://doi.org/10.1117/12.978069

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available