Sampling Based Efficient Algorithm to Estimate the Spectral Radius of Large Graphs

Samar Abbas, Juvaria Tariq, Arif Zaman, Imdadullah Khan

Type: Article

Publication Date: 2017-06-01

Citations: 7

DOI: https://doi.org/10.1109/icdcsw.2017.71

Similar Works

Action	Title	Year	Authors
+	On estimating the Spectral Radius of large graphs through subgraph sampling	2015	Xiaoyu Chu Harish Sethu
+	Approximating the Spectrum of a Graph	2017	David Cohen‐Steiner Weihao Kong Christian Sohler Gregory Valiant
+	Approximating the Spectrum of a Graph	2017	David Cohen‐Steiner Weihao Kong Christian Sohler Gregory Valiant
+	Approximating the Spectrum of a Graph	2018	David Cohen‐Steiner Weihao Kong Christian Sohler Gregory Valiant
+	Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs	2018	Guyue Han Harish Sethu
+	Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs	2018	Guyue Han Harish Sethu
+	Spectral partitioning of random graphs	2001	Frank McSherry
+	Sampling the eigenvalues of a graph	2023	Elif Başkaya Amin Boumenir
+	Spectral Vertex Sampling for Big Complex Graphs	2019	Jingming Hu Seok‐Hee Hong Peter Eades
+	Laplacian Spectral Properties of Graphs from Random Local Samples	2013	Zhengwei Wu Víctor M. Preciado
+	SGT toolbox: a playground for spectral graph theory	2012	Michael D. König
+	Bounds on the Spectral Radius of Digraphs from Subgraph Counts	2020	Ximing Chen Masaki Ogura Víctor M. Preciado
+	Spectrum Estimation from a Few Entries	2017	Ashish Khetan Sewoong Oh
+	Cavity approach for the approximation of spectral density of graphs with heterogeneous structures	2024	Grover E. Castro Guzman Peter F. Stadler André Fujita
+	Laplacian Spectral Properties of Graphs from Random Local Samples	2014	Zhengwei Wu Víctor M. Preciado
+	A Survey and Taxonomy of Graph Sampling	2013	Pili Hu Wing Cheong Lau
+	On the Distribution of the Maximal Clique Size for the Vertices in Real-World Network Graphs and Correlation Studies	2015	Natarajan Meghanathan
+	Spectral Toolkit of Algorithms for Graphs: Technical Report (1)	2023	Peter Macgregor He Sun
+ PDF Chat	Faster Subset Selection for Matrices and Applications	2013	Haim Avron Christos Boutsidis
+	A Unified Approach to Scalable Spectral Sparsification of Directed Graphs	2018	Ying Zhang Zhiqiang Zhao Zhuo Feng

Works That Cite This (4)

Action	Title	Year	Authors
+	On spectral radius of graphs with pendant paths	2019	Hossein Passbani Abbas Salemi
+ PDF Chat	Combinatorial trace method for network immunization	2020	Muhammad Ahmad Sarwan Ali Juvaria Tariq Imdadullah Khan Mudassir Shabbir Arif Zaman
+ PDF Chat	Predicting Attributes of Nodes Using Network Structure	2021	Sarwan Ali Muhammad Haroon Shakeel Imdadullah Khan Safiullah Faizullah Muhammad Asad Khan
+	Computing Graph Descriptors on Edge Streams	2023	Zohair Raza Hassan Sarwan Ali Imdadullah Khan Mudassir Shabbir Waseem Abbas

Works Cited by This (20)

Action	Title	Year	Authors
+ PDF Chat	Epidemic spreading in real networks: an eigenvalue viewpoint	2004	Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos
+	On estimating the Spectral Radius of large graphs through subgraph sampling	2015	Xiaoyu Chu Harish Sethu
+	Spectral norm of random matrices	2005	Van H. Vu
+	Spectral bounds for the clique and independence numbers of graphs	1986	Herbert S. Wilf
+	Some Inequalities for the Largest Eigenvalue of a Graph	2002	Vladimir Nikiforov
+	Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees	2005	Yuan Hong Xiao‐Dong Zhang
+	On the spectral radius of graphs	2004	Aimei Yu Mei Lu Feng Tian
+	Some new bounds on the spectral radius of graphs	2004	Kinkar Ch. Das Pawan Kumar
+	The Eigenvalues of a Graph and Its Chromatic Number	1967	Herbert S. Wilf
+	Chromatic number and spectral radius	2007	Vladimir Nikiforov