Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are similar for graphs and uniform hypergraphs. The ...
School of Computer Science and Engineering, Beihang University, China Xiao Bai Editor information Editors and Affiliations Intelligent Systems Laboratory, University of Bristol, Merchant Venturers Building, Woodland Road, BS8 1UB, Bristol, UK Peter A. Flach , Tijl De Bie & Nello Cristianini , & Ri...
Constructing isospectral non‐isomorphic digraphs from hypergraphs We explore the oriented line graph construction associated with a hypergraph, leading to a construction of pairs of strongly connected directed graphs whos... B Balof,C Storm - 《Journal of Graph Theory》 被引量: 10发表: 2010年 GPU...
We show that the power-law weight distribution has a strong effect on the behavior of random walks. Similar content being viewed by others Node and edge nonlinear eigenvector centrality for hypergraphs Article Open access 02 September 2021 Estimating degree–degree correlation and network cores ...
Equitable partition of hypergraphsHypergraph joiningLoose paths and loose cyclesCorona of hypergraphsHere, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of ...
Mathematics Fractional chromatic numbers and spectra of graphs UNIVERSITY OF SOUTH CAROLINA Linyuan Lu PengXingThis dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spectra of edge-independent random graphs, Laplacian spectra of hypergraphs, and loose Laplacian ...
We also give a distributional picture of the spectrum as a point-set in the complex plane. Finally, we use the technique to analyse the spectrum of 'sunflower hypergraphs', a class that has played a prominent role in extremal hypergraph theory....
We characterize the spectrum of the non-backtracking operator for the sparse HSBM and provide an efficient dimension reduction procedure using the Ihara–Bass formula for hypergraphs. As a result, community detection for the sparse HSBM on |$n$| vertices can be reduced to an eige...
We also give a general distributional picture of the spectrum as apoint-set in the complex plane, and use our techniques to analyze the spectrumof "sunflower hypergraphs", a class that has played a prominent role inextremal hypergraph theory....