Ranking and sparsifying a connection graph

DOI10.1007/978-3-642-30541-2_6MaRDI QIDQ2900586zbMATH OpenOpenAlexFDO

Authors Wen-Bo Zhao, Fan 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 algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Ranking and sparsifying a connection graph
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• \texttt{PageRank} and random walks on graphs
• A Local Clustering Algorithm for Connection Graphs
• Graph sparsification by effective resistances

Cited in

(7)

• Embeddings of Riemannian manifolds with finite eigenvector fields of connection Laplacian
• Toward a spectral theory of cellular sheaves
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• Alternating projection, ptychographic imaging and phase synchronization
• Graph connection Laplacian and random matrices with random blocks
• Ranking and sparsifying a connection graph
• Graph connection Laplacian methods can be made robust to noise

This page was built for publication: Ranking and sparsifying a connection graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900586)