Ranking and Sparsifying a Connection Graph
From MaRDI portal
Publication:4985350
DOI10.1080/15427951.2013.800005zbMath1461.05205OpenAlexW3029774753MaRDI QIDQ4985350
Wen-Bo Zhao, Mark Kempton, Fan R. K. 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
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 (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Angular synchronization by eigenvectors and semidefinite programming
- Representation theoretic patterns in three dimensional cryo-electron microscopy. I: The intrinsic reconstitution algorithm
- On the spectra of general random graphs
- User-friendly tail bounds for sums of random matrices
- Genetic clustering of social networks using random walks
- Principal component analysis.
- Random Sampling in Cut, Flow, and Network Design Problems
- A Sublinear Time Algorithm for PageRank Computations
- Vector diffusion maps and the connection Laplacian
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Viewing Angle Classification of Cryo-Electron Microscopy Images Using Eigenvectors
- A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
- Spectral Sparsification of Graphs
- Bookmark-Coloring Algorithm for Personalized PageRank Computing
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- An Introduction to Random Matrices
- Matrix Analysis
- Laplacian and vibrational spectra for homogeneous graphs
- A Simpler Approach to Matrix Completion
- A Cheeger Inequality for the Graph Connection Laplacian
- Approaching Optimality for Solving SDD Linear Systems
- Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
- Minimum cuts in near-linear time
- Spectral norm of random matrices
This page was built for publication: Ranking and Sparsifying a Connection Graph
