The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.

DOI10.1002/NLA.1877zbMATH Open1313.65081OpenAlexW1944315015WikidataQ59241514 ScholiaQ59241514MaRDI QIDQ2936746FDOQ2936746

G. Li, Gaohang Yu, Liqun Qi

Publication date: 6 January 2015

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1877

Recommendations

• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
• On spectral hypergraph theory of the adjacency tensor
• On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
• Spectral properties of odd-bipartite \(Z\)-tensors and their absolute tensors
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph

zbMATH Keywords

spectral graph theorynumerical examplespolynomial optimizationhypergraphsymmetric tensorsemismoothnesscharacteristic tensormaximum \(Z\)-eigenvalue

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hypergraphs (05C65)

Cites Work

• Tensor Decompositions and Applications
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• A nonsmooth version of Newton's method
• Eigenvalues of a real supersymmetric tensor
• Global optimization with polynomials and the problem of moments
• Semismooth and Semiconvex Functions in Constrained Optimization
• Z-eigenvalue methods for a global polynomial optimization problem
• Global error bounds for piecewise convex polynomials
• On eigenvalue problems of real symmetric tensors
• On the best rank-1 approximation of higher-order supersymmetric tensors
• Shifted Power Method for Computing Tensor Eigenpairs
• GloptiPoly 3: moments, optimization and semidefinite programming
• Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems
• Finding the Largest Eigenvalue of a Nonnegative Tensor
• Spectra of uniform hypergraphs
• An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
• Higher Order Positive Semidefinite Diffusion Tensor Imaging
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Error bound results for generalized D-gap functions of nonsmooth variational inequality problems
• Perron-Frobenius theorem for nonnegative tensors
• Multivariate polynomial minimization and its application in signal processing
• Nonsmooth analysis of eigenvalues
• Algebraic connectivity of an even uniform hypergraph
• Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Laplace eigenvalues of graphs---a survey
• The Łojasiewicz exponent of an analytic function at an isolated zero
• Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
• Semismooth Matrix-Valued Functions
• Error bounds for systems of lower semicontinuous functions in Asplund spaces
• Nonsmooth Equations: Motivation and Algorithms
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Second Order Sufficient Conditions for Weak and Strict Constrained Minima
• Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form

Cited In (74)

• Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• Sharp Z-eigenvalue inclusion set-based method for testing the positive definiteness of multivariate homogeneous forms
• On Best Low Rank Approximation of Positive Definite Tensors
• A hyper-distance-based method for hypernetwork comparison
• Finding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length Three
• On spectral theory of a k-uniform directed hypergraph
• A MODIFIED FR CONJUGATE GRADIENT METHOD FOR COMPUTING -EIGENPAIRS OF SYMMETRIC TENSORS
• Even order uniform hypergraph via the Einstein product
• Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
• Locally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized Proof
• An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
• Distribution of the eigenvalues of a random system of homogeneous polynomials
• The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
• New criteria for \(\mathcal{H}\)-tensors and an application
• Eigenconfigurations of tensors
• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• The Expected Number of Eigenvalues of a Real Gaussian Tensor
• New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
• Computing tensor eigenvalues via homotopy methods
• Some criteria for identifying strong \(\mathcal{H}\)-tensors
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
• Interval tensors and their application in solving multi-linear systems of equations
• On the iterative criterion for strong \(\mathcal{H}\)-tensors
• Generalized Tensor Eigenvalue Problems
• Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
• Inverse Perron values and connectivity of a uniform hypergraph
• Further results on \(B\)-tensors with application to location of real eigenvalues
• New practical criteria for ℋ-tensors and its application
• Primitive tensors and directed hypergraphs
• Spectra of general hypergraphs
• An adaptive gradient method for computing generalized tensor eigenpairs
• On the spectral radius of uniform weighted hypergraph
• Note on \(Z \)-eigenvalue inclusion theorems for tensors
• Title not available (Why is that?)
• Some inequalities for the Hadamard product of tensors
• Melonic dominance and the largest eigenvalue of a large random tensor
• Analytic methods for uniform hypergraphs
• Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
• A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
• Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Decomposition of completely symmetric states
• Properties of some classes of structured tensors
• The spectral theory of tensors and its applications
• An even order symmetric \(B\) tensor is positive definite
• Computing all Laplacian H-eigenvalues for a uniform loose path of length three
• An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms
• On the spectrum of hypergraphs
• Spectral directed hypergraph theory via tensors
• Solving tensor E-eigenvalue problem faster
• Newton Correction Methods for Computing Real Eigenpairs of Symmetric Tensors
• Covariate Regularized Community Detection in Sparse Graphs
• The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
• Circulant tensors with applications to spectral hypergraph theory and stochastic process
• A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
• \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors
• Tensor logarithmic norm and its applications
• The location of H-eigenvalues of real even order symmetry tensors
• Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector
• A survey on the spectral theory of nonnegative tensors
• Computing hypermatrix spectra with the Poisson product formula
• Further results on Cauchy tensors and Hankel tensors
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• The Laplacian of a uniform hypergraph
• Exceptionally regular tensors and tensor complementarity problems
• Further study on \(Z\)-eigenvalue localization set and positive definiteness of fourth-order tensors
• Computing the generalized eigenvalues of weakly symmetric tensors
• \(Z\)-eigenvalue inclusion theorems for tensors
• Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph

Uses Software

• GloptiPoly
• YALMIP

This page was built for publication: The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936746)