Eigenvalue-based entropy and spectrum of bipartite digraph

被引:0
|
作者
Yan Sun
Haixing Zhao
机构
[1] School of Computer of Qinghai Normal University,School of Computer
[2] Qinghai Minzu University,undefined
[3] State Key Laboratory of Tibetan Intelligent Information Processing and Application,undefined
来源
关键词
Directed bipartite complex networks; Spectrum; Eigenvalue-based entropy; In-degree Laplacian matrix; In-degree signless Laplacian matrix;
D O I
暂无
中图分类号
学科分类号
摘要
Graph entropy is an important measure of the evolution and complexity of networks. Bipartite graph is a special network and an important mathematical model for system resource allocation and management. In reality, a network system usually has obvious directionality. The direction of the network, or the movement trend of the network, can be described with spectrum index. However, little research has been done on the eigenvalue-based entropy of directed bipartite network. In this study, based on the adjacency matrix, the in-degree Laplacian matrix and the in-degree signless Laplacian matrix of directed bipartite graph, we defined the eigenvalue-based entropy for the directed bipartite network. Using the eigenvalue-based entropy, we described the evolution law of the directed bipartite network structure. Aiming at the direction and bipartite feature of the directed bipartite network, we improved the generation algorithm of the undirected network. We then constructed the directed bipartite nearest-neighbor coupling network, directed bipartite small-world network, directed bipartite scale-free network, and directed bipartite random network. In the proposed model, spectrum of those directed bipartite network is used to describe the directionality and bipartite property. Moreover, eigenvalue-based entropy is empirically studied on a real-world directed movie recommendation network, in which the law of eigenvalue-base entropy is observed. That is, if eigenvalue-based entropy value of the recommendation system is large, the evolution of movie recommendation network becomes orderless. While if eigenvalue-based entropy value is small, the structural evolution of the movie recommendation network tends to be regular. The simulation experiment shows that eigenvalue-based entropy value in the real directed bipartite network is between the values of a directed bipartite small world and a scale-free network. It shows that the real directed bipartite network has the structural property of the two typical directed bipartite networks. The coexistence of the small-world phenomena and the scale-free phenomena in the real network is consistent with the evolution law of typical network models. The experimental results show that the validity and rationality of the definition of eigenvalue-based entropy, which serves as a tool in the analysis of directed bipartite networks.
引用
收藏
页码:3451 / 3462
页数:11
相关论文
共 50 条
  • [1] Eigenvalue-based entropy and spectrum of bipartite digraph
    Sun, Yan
    Zhao, Haixing
    COMPLEX & INTELLIGENT SYSTEMS, 2022, 8 (04) : 3451 - 3462
  • [2] Eigenvalue-based entropy in directed complex networks
    Sun, Yan
    Zhao, Haixing
    Liang, Jing
    Ma, Xiujuan
    PLOS ONE, 2021, 16 (06):
  • [3] SNR walls in eigenvalue-based spectrum sensing
    Bollig, Andreas
    Disch, Constantin
    Arts, Martijn
    Mathar, Rudolf
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2017,
  • [4] SNR walls in eigenvalue-based spectrum sensing
    Andreas Bollig
    Constantin Disch
    Martijn Arts
    Rudolf Mathar
    EURASIP Journal on Wireless Communications and Networking, 2017
  • [5] Eigenvalue-Based Cooperative Spectrum Sensing algorithm
    Zhang, Shibing
    Yang, Jiaojiao
    Guo, Lili
    PROCEEDINGS OF THE 2012 SECOND INTERNATIONAL CONFERENCE ON INSTRUMENTATION & MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2012), 2012, : 375 - 378
  • [6] On eigenvalue-based cooperative spectrum sensing using feature extraction and maximum entropy fuzzy clustering
    Giri, Manish Kumar
    Majumder, Saikat
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2022, 14 (8) : 10053 - 10067
  • [7] An Improved Eigenvalue-Based Algorithm for Cooperative Spectrum Sensing
    Yang, Miao
    An, Jianping
    Bu, Xiangyuan
    Sun, Lei
    2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
  • [8] On eigenvalue-based cooperative spectrum sensing using feature extraction and maximum entropy fuzzy clustering
    Manish Kumar Giri
    Saikat Majumder
    Journal of Ambient Intelligence and Humanized Computing, 2023, 14 : 10053 - 10067
  • [9] Eigenvalue-Based Spectrum Sensing Algorithms for Cognitive Radio
    Zeng, Yonghong
    Liang, Ying-Chang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (06) : 1784 - 1793
  • [10] On the Eigenvalue-Based Spectrum Sensing and Secondary User Throughput
    Kortun, Ayse
    Ratnarajah, Tharmalingam
    Sellathurai, Mathini
    Liang, Ying-Chang
    Zeng, Yonghong
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (03) : 1480 - 1486