The Laplacian of a uniform hypergraph

被引:0
|
作者
Shenglong Hu
Liqun Qi
机构
[1] The Hong Kong Polytechnic University,Department of Applied Mathematics
来源
关键词
Tensor; Eigenvalue; Hypergraph; Laplacian;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[0,2]$$\end{document}, and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalues of the Laplacian and all the smallest H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalues of its sub-tensors are characterized through the spectral radii of some nonnegative tensors. All the H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalues of the Laplacian that are less than one are completely characterized by the spectral components of the hypergraph and vice verse. The smallest H-eigenvalue, which is also an H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalue, of the Laplacian is zero. When \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document} is even, necessary and sufficient conditions for the largest H-eigenvalue of the Laplacian being two are given. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document} is odd, then its largest H-eigenvalue is always strictly less than two. The largest H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalue of the Laplacian for a hypergraph having at least one edge is one; and its nonnegative eigenvectors are in one to one correspondence with the flower hearts of the hypergraph. The second smallest H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalue of the Laplacian is positive if and only if the hypergraph is connected. The number of connected components of a hypergraph is determined by the H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-geometric multiplicity of the zero H\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}-eigenvalue of the Lapalacian.
引用
收藏
页码:331 / 366
页数:35
相关论文
共 50 条
  • [31] Hypergraph p-Laplacian: A Differential Geometry View
    Saito, Shota
    Mandic, Danilo P.
    Suzuki, Hideyuki
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3984 - 3991
  • [32] The Hardness of 3-Uniform Hypergraph Coloring
    Irit Dinur*
    Oded Regev†
    Clifford Smyth‡
    Combinatorica, 2005, 25 : 519 - 535
  • [33] The Vulnerability of k-Uniform Linear Hypergraph
    Zhao, Ning
    Li, Yinkui
    JOURNAL OF INTERCONNECTION NETWORKS, 2021, 21 (04)
  • [34] Test dense subgraphs in sparse uniform hypergraph
    Yuan, Mingao
    Nan, Yehong
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2021, 50 (20) : 4743 - 4762
  • [36] On the degree, size, and chromatic index of a uniform hypergraph
    Alon, N
    Kim, JH
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1997, 77 (01) : 165 - 170
  • [37] On the random greedy linear uniform hypergraph packing
    Tian, Fang
    Liu, Zi-Long
    Pan, Xiang-Feng
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 87 : 365 - 390
  • [38] THE MAXIMUM CARDINALITY OF UNIFORM ALEATORY HYPERGRAPH LINKAGES
    DELAVEGA, WF
    DISCRETE MATHEMATICS, 1982, 40 (2-3) : 315 - 318
  • [39] NOTE ON HYPERGRAPH OF A MAPPING BETWEEN UNIFORM SPACES
    HITCHCOC.AG
    PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS, 1974, 72 : 129 - 134
  • [40] The partition of a uniform hypergraph into pairs of dependent hyperedges
    Lehel, J
    DISCRETE MATHEMATICS, 1997, 163 (1-3) : 313 - 318