\0,1\ completely positive tensors and multi-hypergraphs

DOI10.1016/J.LAA.2016.08.016zbMATH Open1354.05099arXiv1508.04204OpenAlexW2963658617MaRDI QIDQ501224FDOQ501224

Authors: Changqing Xu, Ziyan Luo, Liqun Qi, Zhibing Chen 

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the multi-hypergraph, regarded as a generalization of graphs, is then introduced to associate with tensors for the study of complete positivity. To describe the dependence of the corresponding zero pattern for a special type of completely positive tensors--the $0,1$ completely positive tensors, the completely positive multi-hypergraph is defined. By characterizing properties of the associated multi-hypergraph, we provide necessary and sufficient conditions for any $(0,1)$ associated tensor to be $0,1$ completely positive. Furthermore, a necessary and sufficient condition for a uniform multi-hypergraph to be completely positive multi-hypergraph is proposed as well.

Full work available at URL: https://arxiv.org/abs/1508.04204

Recommendations

• Hypergraph characterizations of copositive tensors
• Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
• Totally positive matrices and totally positive hypergraphs
• The Laplacian tensor of a multi-hypergraph
• On \(\{0,1\}\) CP tensors and CP pseudographs
• Signed \(k\)-uniform hypergraphs and tensors
• On spectral hypergraph theory of the adjacency tensor
• Copositive tensor detection and its applications in physics and hypergraphs
• Tensor join of hypergraphs and its spectra
• Spectral theory of weighted hypergraphs via tensors

zbMATH Keywords

\((0,1)\) tensor\(\{0, 1 \}\) completely positive tensorcompletely positive tensormulti-hypergraph

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65) Differential geometric aspects in vector and tensor analysis (53A45)

Cites Work

• Title not available (Why is that?)
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• On eigenvalue problems of real symmetric tensors
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
• Title not available (Why is that?)
• On spectral hypergraph theory of the adjacency tensor
• Perron-Frobenius theorem for nonnegative tensors
• Symmetric nonnegative tensors and copositive tensors
• Title not available (Why is that?)
• Characterization of completely positive graphs
• Separating doubly nonnegative and completely positive matrices
• Completely positive reformulations for polynomial optimization
• The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
• \(\{0,1\}\) completely positive matrices
• Uniform and minimal {0,1} – cpmatrices
• Essentially positive tensors
• Title not available (Why is that?)
• Completely positive matrices.
• Completely positive matrices and positivity of least squares solutions
• Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
• Numerical optimization for symmetric tensor decomposition
• The CP-matrix completion problem

Cited In (9)

• On \(\{0,1\}\) CP tensors and CP pseudographs
• Dehomogenization for completely positive tensors
• Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
• Completely positive tensor recovery with minimal nuclear value
• Completely positive binary tensors
• A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
• Some characterizations of \(M\)-tensors via digraphs
• Halos and undecidability of tensor stable positive maps
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications

This page was built for publication: \(\{0,1\}\) completely positive tensors and multi-hypergraphs

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