Hypergraph analysis based on a compatible tensor product structure

DOI10.1016/J.LAA.2023.11.003MaRDI QIDQ6185980zbMATH OpenFDO

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

zbMATH Keywords

tensor productuniform hypergraphalgebraic connectivityLaplacian eigenmapconnectivity optimization

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Connectivity (05C40) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Even order uniform hypergraph via the Einstein product
• Algebraic connectivity of an even uniform hypergraph
• Eigenvalues of the adjacency tensor on products of hypergraphs
• Scalable tensor methods for nonuniform hypergraphs
• The abstract Laplacian tensor of a hypergraph with applications in clustering

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 2044509 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Algebraic connectivity of an even uniform hypergraph
• Algebraic connectivity of directed graphs
• Analytic connectivity of \(k\)-uniform hypergraphs
• Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
• Cutsets and partitions of hypergraphs
• Directed hypergraphs and applications
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Explicit Solutions and Stability Properties of Homogeneous Polynomial Dynamical Systems
• Finding diverse ways to improve algebraic connectivity through multi-start optimization
• Flows on hypergraphs
• Fourth-order tensor Riccati equations with the Einstein product
• Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
• Hypergraph Cuts with General Splitting Functions
• Hypernetworks in a directed hypergraph
• Improving connectivity of compromised digital networks via algebraic connectivity maximisation
• Inverses of triangular matrices and bipartite graphs
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• Maximizing algebraic connectivity for certain families of graphs
• Moore–Penrose inverse of tensors via Einstein product
• Multilinear Control Systems Theory
• Optimizing algebraic connectivity by edge rewiring
• Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
• Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Solving multilinear systems via tensor inversion
• Spectra of hypergraphs and applications
• Spectra of uniform hypergraphs
• Spectra of weighted uniform hypertrees
• Spectral directed hypergraph theory via tensors
• Tensor analysis. Spectral theory and special tensors
• The extremal spectral radii of k-uniform supertrees
• Theory and Computation of Complex Tensors and its Applications
• Theory and computation of tensors. Multi-dimensional arrays

Cited in

(3)

• Scalable tensor methods for nonuniform hypergraphs
• The analytic connectivity in uniform hypergraphs: Properties and computation
• Even order uniform hypergraph via the Einstein product

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)