Ranking and sparsifying a connection graph

DOI10.1080/15427951.2013.800005MaRDI QIDQ4985350zbMATH OpenOpenAlexFDO

Authors Wen-Bo Zhao, Mark Kempton, Fan Chung

Publication date 23 April 2021

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2013.800005

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
• A local clustering algorithm for connection graphs

Cites work

• A Cheeger Inequality for the Graph Connection Laplacian
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• A simpler approach to matrix completion
• A sublinear time algorithm for PageRank computations
• An introduction to random matrices
• Angular synchronization by eigenvectors and semidefinite programming
• Approaching optimality for solving SDD linear systems
• Bookmark-Coloring Algorithm for Personalized PageRank Computing
• Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
• Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
• Genetic clustering of social networks using random walks
• scientific article; zbMATH DE number 1003274 (Why is no real title available?)
• scientific article; zbMATH DE number 1256718 (Why is no real title available?)
• scientific article; zbMATH DE number 5485569 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• Laplacian and vibrational spectra for homogeneous graphs
• Matrix Analysis
• Minimum cuts in near-linear time
• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• On the spectra of general random graphs
• Principal component analysis.
• Random sampling in cut, flow, and network design problems
• Representation theoretic patterns in three dimensional cryo-electron microscopy. I: The intrinsic reconstitution algorithm
• Spectral norm of random matrices
• Spectral sparsification of graphs
• User-friendly tail bounds for sums of random matrices
• Vector diffusion maps and the connection Laplacian
• Viewing angle classification of cryo-electron microscopy images using eigenvectors

Cited in

(9)

• The degree ratio ranking method for directed graphs
• Ranking and sparsifying a connection graph
• Random walks, conductance, and resistance for the connection graph Laplacian
• On a generalization of Wasserstein distance and the Beckmann problem to connection graphs
• Sparsification of the regularized magnetic Laplacian with multi-type spanning forests
• Repelling curvature via -repelling Laplacian on positive connected signed graphs
• Discrete Bakry-Émery curvature tensors and matrices of connection graphs
• Connection heat kernel on connection lattices and connection discrete torus
• Expansion in matrix-weighted graphs

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 Q4985350)