The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning

DOI10.1137/16M1094828zbMath1375.05184OpenAlexW2767666094MaRDI QIDQ4594176

No author found.

Publication date: 17 November 2017

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1094828

zbMATH Keywords

optimizationeigenvalueeigenvectorFiedler vectorLaplacian tensorhypergraph partitioningface clustering

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Applications of mathematical programming (90C90) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A trust region algorithm for computing extreme eigenvalues of tensors ⋮ The abstract Laplacian tensor of a hypergraph with applications in clustering ⋮ The bounds on spectral radius of nonnegative tensors via general product of tensors ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ On a generalization of the spectral Mantel's theorem ⋮ Some inequalities on the spectral radius of nonnegative tensors ⋮ Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ The high order spectrum of a graph and its applications in graph colouring and clique counting ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ Noda iteration for computing generalized tensor eigenpairs ⋮ Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing ⋮ Outer and (b,c) inverses of tensors ⋮ Weighted Moore-Penrose inverses of arbitrary-order tensors ⋮ Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions ⋮ Generalized inverses of tensors via a general product of tensors ⋮ Computing tensor generalized inverses via specialization and rationalization ⋮ Multiplications and eigenvalues of tensors via linear maps ⋮ A derivative-free algorithm for spherically constrained optimization

Uses Software

• LAMG
• TenEig

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of uniform hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Eigenvalues and invariants of tensors
• Spectral clustering and its use in bioinformatics
• Laplacian eigenvalues and partition problems in hypergraphs
• Modeling hypergraphs by graphs with the same mincut properties
• Three-way distances
• Algebraic connectivity of an even uniform hypergraph
• Spectral clustering based on local linear approximations
• The Laplacian of a uniform hypergraph
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• Computing extreme eigenvalues of large scale Hankel tensors
• Eigenvalues of a real supersymmetric tensor
• Optimization theory and methods. Nonlinear programming
• Computing Tensor Eigenvalues via Homotopy Methods
• Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
• An MBO Scheme on Graphs for Classification and Image Processing
• Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
• The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
• On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
• Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
• Spectral Extremal Problems for Hypergraphs
• All Real Eigenvalues of Symmetric Tensors
• Tensor Analysis
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Revisiting Hypergraph Models for Sparse Matrix Partitioning
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions