Computing the \(p\)-spectral radii of uniform hypergraphs with applications
From MaRDI portal
Publication:1747024
DOI10.1007/S10915-017-0520-XzbMath1386.05103arXiv1703.04275OpenAlexW2607371007MaRDI QIDQ1747024
Jingya Chang, Hong Yan, Weiyang Ding, Liqun Qi
Publication date: 26 April 2018
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04275
Programming involving graphs or networks (90C35) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)
Related Items (11)
Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ The abstract Laplacian tensor of a hypergraph with applications in clustering ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ The eigenvectors to the \(p\)-spectral radius of general hypergraphs ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ Computing tensor Z-eigenvalues via shifted inverse power method ⋮ A refined bound for the Z1-spectral radius of tensors ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Connected hypergraphs with small spectral radius
- The extremal spectral radii of \(k\)-uniform supertrees
- A reductive approach to hypergraph clustering: an application to image segmentation
- Spectra of uniform hypergraphs
- Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
- Spectral clustering and the high-dimensional stochastic blockmodel
- On spectral hypergraph theory of the adjacency tensor
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A note on the jumping constant conjecture of Erdős
- Perron-Frobenius theorem for nonnegative tensors
- Generating non-jumping numbers recursively
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Hypergraphs do not jump
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Analytic methods for uniform hypergraphs
- The Laplacian of a uniform hypergraph
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- Eigenvalues of a real supersymmetric tensor
- Bounds on graph eigenvalues. II
- A hypergraph extension of Turán's theorem
- Computing Tensor Eigenvalues via Homotopy Methods
- Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Lagrangians of Hypergraphs
- Fiber Orientation Distribution Estimation Using a Peaceman--Rachford Splitting Method
- Shifted Power Method for Computing Tensor Eigenpairs
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Spectral Extremal Problems for Hypergraphs
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
- All Real Eigenvalues of Symmetric Tensors
- Graph-Based Representations in Pattern Recognition
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Tensor Analysis
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Fast Hankel tensor–vector product and its application to exponential data fitting
- On the structure of linear graphs
- Application of hypergraph theory in chemistry
This page was built for publication: Computing the \(p\)-spectral radii of uniform hypergraphs with applications
