Abstract
Extremely large graphs, such as those representing the Web or online social networks, require prohibitively large computational resources for an analysis of any of their complex properties. In this paper, we investigate an algorithmic approach to overcoming this difficulty by inferring key properties of the full graph using a strategic sample of small subgraphs of the graph. We focus, in particular, on the spectral radius (the largest eigenvalue of the adjacency matrix) of the graph because of its relationship to multiple highly relevant properties of graphs. We describe the Spectral Radius Estimator (SRE), a new greedy algorithm based on adding nodes with high estimated eigenvalue centrality into sample subgraphs. We present results on the performance of the SRE on real-world graphs and show that it estimates the spectral radius of real graphs with 98% to 99.99% accuracy using a subgraph of size less than about 4% of the full graph. This work demonstrates the feasibility and the potential of subgraph sampling as a computationally cheap means of inferring complex properties of extremely large graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
