Ranking and Sparsifying a Connection Graph

DOI10.1007/978-3-642-30541-2_6zbMath1342.05182OpenAlexW2173910640MaRDI QIDQ2900586

Wen-Bo Zhao, Fan R. K. Chung

Publication date: 23 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30541-2_6

zbMATH Keywords

high-dimensional data setsPageRank

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (5)

Alternating projection, ptychographic imaging and phase synchronization ⋮ Graph connection Laplacian and random matrices with random blocks ⋮ Graph connection Laplacian methods can be made robust to noise ⋮ Embeddings of Riemannian manifolds with finite eigenvector fields of connection Laplacian ⋮ Toward a spectral theory of cellular sheaves

This page was built for publication: Ranking and Sparsifying a Connection Graph