Graph sampling for Internet topologies using normalized Laplacian spectral features

DOI10.1016/J.INS.2018.12.073zbMath1443.68023OpenAlexW2907685836WikidataQ128638818 ScholiaQ128638818MaRDI QIDQ2005529

Bo Jiao, Li-Ning Xing, Wensheng Zhang, Jian-mai Shi

Publication date: 8 October 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.12.073

zbMATH Keywords

bipartite graphgraph samplingnormalized Laplacian spectrumweighted spectral distributioninterdomain Internet topology

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Internet topics (68M11)

Cites Work

• Sampling social networks using shortest paths
• Scaling of weighted spectral distribution in deterministic scale-free networks
• Unbiased sampling of network ensembles
• Correlation between weighted spectral distribution and average path length in evolving networks
• The 3-cycle weighted spectral distribution in evolving community-based networks
• Coupling Online and Offline Analyses for Random Power Law Graphs

This page was built for publication: Graph sampling for Internet topologies using normalized Laplacian spectral features