{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:21:38Z","timestamp":1763018498603,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["(Grant Nos.11661069,61663041)"],"award-info":[{"award-number":["(Grant Nos.11661069,61663041)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the science and technology plan of qinghai province, china","award":["(Grant No.2019-ZJ-7012)"],"award-info":[{"award-number":["(Grant No.2019-ZJ-7012)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s40747-022-00679-9","type":"journal-article","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T06:02:45Z","timestamp":1645768965000},"page":"3451-3462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Eigenvalue-based entropy and spectrum of bipartite digraph"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9300-3854","authenticated-orcid":false,"given":"Yan","family":"Sun","sequence":"first","affiliation":[]},{"given":"Haixing","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,25]]},"reference":[{"issue":"1","key":"679_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.2298\/AADM101121030A","volume":"5","author":"S Ayyaswamy","year":"2011","unstructured":"Ayyaswamy S, Balachandran S, Gutman I (2011) Upper bound for the energy of strongly connected digraphs. Appl Anal Discret Math 5(1):37\u201345","journal-title":"Appl Anal Discret Math"},{"issue":"5439","key":"679_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"10","key":"679_CR3","first-page":"4517","volume":"67","author":"D Bonchev","year":"1977","unstructured":"Bonchev D, Trinajsti N (1977) Information theory, distance matrix, and molecular branching. Chem Phys 67(10):4517\u20134533","journal-title":"Chem Phys"},{"issue":"4 Pt 2","key":"679_CR4","doi-asserted-by":"publisher","first-page":"046113","DOI":"10.1103\/PhysRevE.78.046113","volume":"78","author":"E Burgos","year":"2008","unstructured":"Burgos E, Ceva H, Hernandez L, Perazzo RP, Devoto M, Medan D (2008) Two classes of bipartite networks: nested biological and social systems. Phys Rev E Stat Nonlinear Softw Matter Phys 78(4 Pt 2):046113","journal-title":"Phys Rev E Stat Nonlinear Softw Matter Phys"},{"key":"679_CR5","unstructured":"Cvetkovi DM, Doob M, Sachs H (1980) Spectra of graphs,theory and application. Spectra Graphs Theory Appl"},{"issue":"3Pt2A","key":"679_CR6","doi-asserted-by":"publisher","first-page":"035103","DOI":"10.1103\/PhysRevE.66.035103","volume":"66","author":"H Ebel","year":"2002","unstructured":"Ebel H, Mielsch LI, Bornholdt S (2002) Scale-free topology of e-mail networks. Phys Rev E 66(3Pt2A):035103","journal-title":"Phys Rev E"},{"key":"679_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdios","year":"1959","unstructured":"Erdios P, Renyi A (1959) On random graphs. Publicationes Mathematicea 6:290\u2013297","journal-title":"Publicationes Mathematicea"},{"key":"679_CR8","doi-asserted-by":"crossref","unstructured":"Ergung (2002) Human sexual contact network as a bipartite graph. Phyical A 308(1):483\u2013488","DOI":"10.1016\/S0378-4371(02)00628-3"},{"key":"679_CR9","unstructured":"F, F.K (2003) Some properties of directed graphs. J Ningbo Univ Nat Sci Edn 3:228\u2013231"},{"key":"679_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. Proc Acm Sigcomm 29(4):251\u2013262","DOI":"10.1145\/316194.316229"},{"key":"679_CR11","doi-asserted-by":"crossref","unstructured":"Farkas IJ, Dernyi I, Barabsi A, Vicsek T (2001) Spectra of \u201creal-world\u201d graphs: Beyond the semicircle law. Phys Rev E Stat Nonlinear Softw Matter Phys 64(2):026704","DOI":"10.1103\/PhysRevE.64.026704"},{"issue":"1","key":"679_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01164452","volume":"14","author":"O Ivanciuc","year":"1993","unstructured":"Ivanciuc O, Balaban TS, Balaban AT (1993) Chemical graphs with degenerate topological indices based on information on distances. J Math Chem 14(1):21\u201333","journal-title":"J Math Chem"},{"issue":"1","key":"679_CR13","first-page":"41","volume":"7","author":"O Ivanciuc","year":"2010","unstructured":"Ivanciuc O, Ivanciuc T, Diudea MV (2010) Cheminform abstract: Polynomials and spectra of molecular graphs. Cheminform 7(1):41\u201367","journal-title":"Cheminform"},{"issue":"3","key":"679_CR14","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1021\/ci000086f","volume":"41","author":"O Ivanciuc","year":"2001","unstructured":"Ivanciuc O, Ivanciuc T, Klein DJ, Seitz WA, Balaban AT (2001) Wiener index extension by counting even\/odd graph distances. J Chem Inf Comput 41(3):536\u2013549","journal-title":"J Chem Inf Comput"},{"issue":"1","key":"679_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s13278-014-0234-0","volume":"4","author":"A Javari","year":"2014","unstructured":"Javari A, Gharibshah J, Jalili M (2014) Recommender systems based on collaborative filtering and resource allocation. Soc Netw Anal Min 4(1):234","journal-title":"Soc Netw Anal Min"},{"issue":"11","key":"679_CR16","first-page":"4303","volume":"27","author":"L Lihui","year":"2010","unstructured":"Lihui L, Shiguang J, Hu J (2010) Privacy-preserving data publishing using bipartite graph. Appl Res Comput 27(11):4303\u20134308","journal-title":"Appl Res Comput"},{"key":"679_CR17","doi-asserted-by":"crossref","unstructured":"Liljeros F, Edling C, Amaral R, Nunes LA, Stanley EE, Aberg Y (2001) The web of human sexual contacts. Nature","DOI":"10.1038\/35082140"},{"key":"679_CR18","unstructured":"M, B, P, N (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inf Process Syst 14(6):585\u2013591"},{"issue":"2","key":"679_CR19","first-page":"225","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz A (1968) Entropy and the complexity of graphs: Ii. the information content of digraphs and infinite graphs. Bull Math Biol 30(2):225-240","journal-title":"Bull Math Biol"},{"key":"679_CR20","unstructured":"Murai T (2003) Spectral analysis of directed complex networks. The Physical Society of Japan (JPS)"},{"issue":"3","key":"679_CR21","doi-asserted-by":"publisher","first-page":"036128","DOI":"10.1103\/PhysRevE.66.036128","volume":"66","author":"A Ramezanpour","year":"2002","unstructured":"Ramezanpour A, Karimipour V (2002) Simple models of small world networks with directed links. Phys Rev E Stat Nonlinear Soft Matter Phys 66(3):036128","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"issue":"6","key":"679_CR22","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1021\/ci970242r","volume":"28","author":"M Randic","year":"1997","unstructured":"Randic M, Muller WR, Knop JV (1997) The characteristic polynomial as a structure discriminator. J Chem Inf Comput Sci 28(6):1072\u20131077","journal-title":"J Chem Inf Comput Sci"},{"issue":"3","key":"679_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02477860","volume":"17","author":"N Rashevsky","year":"1955","unstructured":"Rashevsky N (1955) Life, information theory, and topology. Bull Math Biophys 17(3):229\u2013235","journal-title":"Bull Math Biophys"},{"key":"679_CR24","doi-asserted-by":"crossref","unstructured":"Rodder W, Dellnitz A, Kulmann F, Litzinger S, Reucher E (2019) Bipartite structures in social networks: Traditional versus entropy-driven analyses. Entropy (Basel) 21(3)","DOI":"10.3390\/e21030277"},{"key":"679_CR25","unstructured":"S, G (2011) The microstructure of the money market before and after the financial crisis, a network perspective. CEIS Tor Vergata, Research Paper Series 9(1):181"},{"issue":"2","key":"679_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.015104","volume":"66","author":"N Schwartz","year":"2002","unstructured":"Schwartz N, Cohen R, Ben-Avraham D, Barabsi A, Havlin S (2002) Percolation in directed scale-free networks. Physical Review E Statistical Nonlinear Soft Matter Physics 66(2):015104","journal-title":"Physical Review E Statistical Nonlinear Soft Matter Physics"},{"key":"679_CR27","doi-asserted-by":"crossref","unstructured":"Shannon A (1948) mathematical theory of communication. Math Theory Commun","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"issue":"1","key":"679_CR28","first-page":"147","volume":"67","author":"L Sivakumar","year":"2012","unstructured":"Sivakumar L, Dehmer M, Varmuza K (2012) Uniquely discriminating molecular structures using novel eigenvalue-based descriptors. MATCH Commun Math Comput Chem 67(1):147\u2013172","journal-title":"MATCH Commun Math Comput Chem"},{"key":"679_CR29","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442","DOI":"10.1038\/30918"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00679-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00679-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T22:12:47Z","timestamp":1674857567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00679-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,25]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["679"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00679-9","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2022,2,25]]},"assertion":[{"value":"13 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}