Hypergraph analysis based on a compatible tensor product structure
DOI10.1016/J.LAA.2023.11.003zbMATH Open1530.05137arXiv2310.04682MaRDI QIDQ6185980FDOQ6185980
Authors: Jiaqi Gu, Shenghao Feng, Yimin Wei
Publication date: 9 January 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.04682
Recommendations
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Connectivity (05C40) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Directed hypergraphs and applications
- Title not available (Why is that?)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Spectra of uniform hypergraphs
- Algebraic connectivity of an even uniform hypergraph
- Spectra of hypergraphs and applications
- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- The extremal spectral radii of \(k\)-uniform supertrees
- Inverses of triangular matrices and bipartite graphs
- Hypernetworks in a directed hypergraph
- Algebraic connectivity of directed graphs
- Sensor Networks With Random Links: Topology Design for Distributed Consensus
- Flows on hypergraphs
- Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
- Analytic connectivity of \(k\)-uniform hypergraphs
- Title not available (Why is that?)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Multilinear Control Systems Theory
- Moore–Penrose inverse of tensors via Einstein product
- Solving multilinear systems via tensor inversion
- Tensor analysis. Spectral theory and special tensors
- Cutsets and partitions of hypergraphs
- Theory and Computation of Complex Tensors and its Applications
- Spectra of weighted uniform hypertrees
- Explicit Solutions and Stability Properties of Homogeneous Polynomial Dynamical Systems
- Hypergraph Cuts with General Splitting Functions
- Maximizing algebraic connectivity for certain families of graphs
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
- Spectral directed hypergraph theory via tensors
- Theory and computation of tensors. Multi-dimensional arrays
- Optimizing algebraic connectivity by edge rewiring
- Fourth-order tensor Riccati equations with the Einstein product
- Improving connectivity of compromised digital networks via algebraic connectivity maximisation
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- Finding diverse ways to improve algebraic connectivity through multi-start optimization
Cited In (3)
This page was built for publication: Hypergraph analysis based on a compatible tensor product structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185980)