Hypergraph analysis based on a compatible tensor product structure
From MaRDI portal
Publication:6185980
DOI10.1016/j.laa.2023.11.003zbMath1530.05137arXiv2310.04682MaRDI QIDQ6185980
Shenghao Feng, Jiaqi Gu, Yi-Min 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
Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extremal spectral radii of \(k\)-uniform supertrees
- Spectra of uniform hypergraphs
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Flows on hypergraphs
- Directed hypergraphs and applications
- Spectra of hypergraphs and applications
- Algebraic connectivity of an even uniform hypergraph
- Improving connectivity of compromised digital networks via algebraic connectivity maximisation
- Spectra of weighted uniform hypertrees
- Maximizing algebraic connectivity for certain families of graphs
- Optimizing algebraic connectivity by edge rewiring
- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- Inverses of triangular matrices and bipartite graphs
- Hypernetworks in a directed hypergraph
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- Moore–Penrose inverse of tensors via Einstein product
- Spectral directed hypergraph theory via tensors
- Solving Multilinear Systems via Tensor Inversion
- Analytic connectivity of k-uniform hypergraphs
- Sensor Networks With Random Links: Topology Design for Distributed Consensus
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Finding diverse ways to improve algebraic connectivity through multi-start optimization
- Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
- Fourth-order tensor Riccati equations with the Einstein product
- Hypergraph Cuts with General Splitting Functions
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- Theory and Computation of Complex Tensors and its Applications
- Tensor Analysis
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
- Algebraic connectivity of directed graphs
- Cutsets and partitions of hypergraphs
- Multilinear Control Systems Theory
- Explicit Solutions and Stability Properties of Homogeneous Polynomial Dynamical Systems
This page was built for publication: Hypergraph analysis based on a compatible tensor product structure