A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians

@article{Urschel2014ACM,
title={A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians},
author={John C. Urschel and Xiaozhe Hu and Jinchao Xu and Ludmil T. Zikatanov},
journal={arXiv: Numerical Analysis},
year={2014}
}
• Published 1 December 2014
• Computer Science
• arXiv: Numerical Analysis
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise smoothing for refinement. To gain theoretical insight, we also consider the related cascadic…
27 Citations

Tables from this paper

Improvement of the Cascadic Multigrid Algorithm with a Gauss Seidel Smoother to Efficiently Compute the Fiedler Vector of a Graph Laplacian
In this paper, we detail the improvement of the Cascadic Multigrid algorithm with the addition of the Gauss Seidel algorithm in order to compute the Fiedler vector of a graph Laplacian, which is the
A Cascadic Multigrid Method for Eigenvalue Problem
• Computer Science
• 2014
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme, which can be solved by smoothing steps on a series of multileVEL finite element spaces and eigen value problem solving on the coarsest finite element space.
Computing the diffusion state distance on graphs via algebraic multigrid and random projections
• Computer Science, Mathematics
Numer. Linear Algebra Appl.
• 2018
Numerical results for real‐world protein–protein interaction networks are presented to demonstrate the efficiency and robustness of the proposed new approaches for computing DSD.
A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians
• Computer Science, Mathematics
SIAM Journal on Scientific Computing
• 2021
A novel strategy to compute a posteriori error estimators which aid multilevel iterative solvers for linear systems of graph Laplacians by constructing a Helmholtz decomposition on the graph based on a spanning tree and the corresponding cycle space is proposed.
Fiedler Vector Approximation via Interacting Random Walks
• Mathematics, Computer Science
Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
• 2020
This paper develops a framework in which a stochastic process is constructed based on a set of interacting random walks on a graph and shows that a suitably scaled version of the stochastics process converges to the Fiedler vector for a sufficiently large number of walks.
Fiedler Vector Approximation via Interacting RandomWalks
• Computer Science, Mathematics
SIGMETRICS
• 2020
This paper develops a framework in which a stochastic process is constructed based on a set of interacting random walks on a graph and shows that a suitably scaled version of the stochastics process converges to the Fiedler vector for a sufficiently large number of walks.
Algebraic Multigrid for Least Squares Problems on Graphs with Applications to HodgeRank
• Computer Science, Mathematics
2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
• 2017
This work investigates the effectiveness of the unsmoothed aggregation AMG (UA-AMG) method and shows it is more appropriate for graph-related problems due to its ability to maintain the structure of graphs in the multilevel hierarchy.
On the approximation of Laplacian eigenvalues in graph disaggregation
• Computer Science, Mathematics
• 2016
This work proves results regarding the spectral approximation of the Laplacian of the original graph by the Laplin of the disaggregated graph, as well as constructing an alternate disaggregation operator whose eigenvalues interlace those of theOriginal LaplACian.
An Adaptive Multigrid Method Based on Path Cover
• Computer Science
SIAM J. Sci. Comput.
• 2019
We propose a path cover adaptive algebraic multigrid (PC-$\alpha$AMG) method for solving linear systems of weighted graph Laplacians and can also be applied to discretized second order elliptic

References

SHOWING 1-10 OF 33 REFERENCES
Drawing Huge Graphs by Algebraic Multigrid Optimization
• Computer Science
Multiscale Model. Simul.
• 2003
An extremely fast graph drawing algorithm for very large graphs, which is term ACE (for Algebraic multigrid Computation of Eigenvectors), which finds an optimal drawing by minimizing a quadratic energy function.
A multigrid method based on graph matching for convection–diffusion equations
• Mathematics, Computer Science
Numer. Linear Algebra Appl.
• 2003
This paper proves that the coarsening technique preserves the M matrix property, and gives several numerical examples illustrating the robustness of the method with respect to the variations in both the diffusion and convection coefficients.
The rate of convergence is proved in two cases: for uniform grids and for grids with special refinement near some angular points, which is independent of an amount of unknowns and a number of grids.
The cascadic multigrid method for elliptic problems
• Computer Science
• 1996
An adaptive control strategy for the number of iterations on successive refinement levels for possibly highly non-uniform grids is worked out on the basis of a posteriori estimates and numerical tests confirm the efficiency and robustness of the cascadic multigrid method.
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• Computer Science
SIAM J. Sci. Comput.
• 2012
A Lean Algebraic Multigrid (LAMG) solver of the symmetric linear system Ax=b is presented, which combines a lean piecewise-constant interpolation, judicious node aggregation based on a new node proximity measure (the affinity), and an energy correction of coarse-level systems to result in fast convergence and substantial setup and memory savings.
A Subspace Cascadic Multigrid Method for Mortar Elements
• Computer Science
Computing
• 2002
A cascadic multigrid method for elliptic problems with strong material jumps is proposed and analyzed and numerical results illustrate the efficiency of the new subspace CMG algorithm.
University Utrecht a Generalized Jacobi-davidson Iteration Method for Linear Eigenvalue Problems a Generalized Jacobi-davidson Iteration Method for Linear Eigenvalue Problems
In this paper we study the Davidson method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors. The method is shown to have an
A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems
• Mathematics
SIAM Rev.
• 2000
A new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors is proposed that has improved convergence properties and that may be used for general matrices.
A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems
• Mathematics
SIAM J. Matrix Anal. Appl.
• 1996
A new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors is proposed that has improved convergence properties and that may be used for general matrices.