Hypergraph Analysis Based on a Compatible Tensor Product Structure

2023/10/07 by Jiaqi Gu, Gu, Jiaqi, Shenghao Feng +3
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Data Management and Algorithms #FOS: Mathematics #Numerical Analysis (math.NA) #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2310.04682

openalex publication_date 2023/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose a tensor product structure that is compatible with the hypergraph structure. We define the algebraic connectivity of the (m+1)-uniform hypergraph in this product, and prove the relationship with the vertex connectivity. We introduce some connectivity optimization problem into the hypergraph, and solve them with the algebraic connectivity. We introduce the Laplacian eigenmap algorithm to the hypergraph under our tensor product.

Related

• Computing The Analytic Connectivity of A Uniform Hypergraph
• The geometry connectivity of hypergraphs
• On the spectrum of directed uniform and non-uniform hypergraphs
• Tensor join of hypergraphs and its spectra
• Hypergraph Partitioning using Tensor Eigenvalue Decomposition