Faxu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Faxu Li has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Liang Wei
Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Peoples R China
4 shared publications- Liang Wei
The State Key Laboratory of Tibetan Intelligence, Qinghai Normal University , Xining 810008, Qinghai
4 shared publications - Pengyue Li
School of Computer, Qinghai Normal University, Xining 810008, China
4 shared publications - Feng Hu
School of Computer, Qinghai Normal University, Xining 810008, China
3 shared publications Defang Wang
College of Computer, Qinghai Normal University, Xining, China
2 shared publicationsHui Xu
College of Computer, Qinghai Normal University, Xining, China
2 shared publications
Latest Publications
- 2 November 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 69 (3) , 561-572
Information dissemination in scale-free hypernetwork with variable local-world
With the continuous progress of Internet technology and the popularization of social platforms, the speed and scope of information dissemination have become more rapid and extensive. We proposed a variable local-world scale-free hypernetwork model, so that the establishment of new connections can be more in line with the evolution mechanism of the real social network. Theory and simulation prove that hyperdegree distribution is not affected by the neighbor order, and the theory agrees with the simulation. Combining the SIS model based on the reaction process (RP) strategy and the mean-field theory, we derive a theoretical expression for the density of informed nodes in steady state. The effects of hypernetwork structure parameters and dissemination parameters on information dissemination under two strategies are comparatively analyzed through simulation experiments. Most noteworthy, as neighbor order $n$ increases, it decreases the information dissemination rate under RP strategy and increases the information dissemination rate under contact process strategy, but both steady-state values remain the same. The results of the study provide a new perspective for a deeper understanding of the establishment of new relationships and information dissemination in social networks, as well as a theoretical basis for other practical applications that require local-world preference of connections.- 2 November 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 69 (3) , 561-572
Information dissemination in scale-free hypernetwork with variable local-world
With the continuous progress of Internet technology and the popularization of social platforms, the speed and scope of information dissemination have become more rapid and extensive. We proposed a variable local-world scale-free hypernetwork model, so that the establishment of new connections can be more in line with the evolution mechanism of the real social network. Theory and simulation prove that hyperdegree distribution is not affected by the neighbor order, and the theory agrees with the simulation. Combining the SIS model based on the reaction process (RP) strategy and the mean-field theory, we derive a theoretical expression for the density of informed nodes in steady state. The effects of hypernetwork structure parameters and dissemination parameters on information dissemination under two strategies are comparatively analyzed through simulation experiments. Most noteworthy, as neighbor order $n$ increases, it decreases the information dissemination rate under RP strategy and increases the information dissemination rate under contact process strategy, but both steady-state values remain the same. The results of the study provide a new perspective for a deeper understanding of the establishment of new relationships and information dissemination in social networks, as well as a theoretical basis for other practical applications that require local-world preference of connections.- 21 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 508
SEIAR rumor spreading model with antagonistic states in hypernetworks
- 21 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 508
SEIAR rumor spreading model with antagonistic states in hypernetworks
- 26 September 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 654
Information dissemination in growing scale-free hypernetworks with tunable clustering
- 26 September 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 654
Information dissemination in growing scale-free hypernetworks with tunable clustering
- RetractionOpen Access
- 2 April 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 47 (3) , 1
Retraction Note: Identifying vital nodes in hypernetwork based on local centrality
- 2 April 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 47 (3) , 1
RetractionOpen AccessRetraction Note: Identifying vital nodes in hypernetwork based on local centrality
- 25 February 2024
- Published by Springer Nature
- p. 659-674
Identifying Vital Nodes in Hypernetworks Based on Improved PageRank Algorithm and Information Entropy
- 25 February 2024
- Published by Springer Nature
- p. 659-674
Identifying Vital Nodes in Hypernetworks Based on Improved PageRank Algorithm and Information Entropy
- Open Access
- 14 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8212
Study of Information Dissemination in Hypernetworks with Adjustable Clustering Coefficient
The structure of a model has an important impact on information dissemination. Many information models of hypernetworks have been proposed in recent years, in which nodes and hyperedges represent the individuals and the relationships between the individuals, respectively. However, these models select old nodes based on preference attachment and ignore the effect of aggregation. In real life, friends of friends are more likely to form friendships with each other, and a social network should be a hypernetwork with an aggregation phenomenon. Therefore, a social hypernetwork evolution model with adjustable clustering coefficients is proposed. Subsequently, we use the SIS (susceptible–infectious–susceptible) model to describe the information propagation process in the aggregation-phenomenon hypernetwork. In addition, we establish the relationship between the density of informed nodes and the structural parameters of the hypernetwork in a steady state using the mean field theory. Notably, modifications to the clustering coefficients do not impact the hyperdegree distribution; however, an increase in the clustering coefficients results in a reduced speed of information dissemination. It is further observed that the model can degenerate to a BA (Barabási–Albert) hypernetwork by setting the clustering coefficient to zero. Thus, the aggregation-phenomenon hypernetwork is an extension of the BA hypernetwork with stronger applicability.
- 14 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8212
Open AccessStudy of Information Dissemination in Hypernetworks with Adjustable Clustering Coefficient
The structure of a model has an important impact on information dissemination. Many information models of hypernetworks have been proposed in recent years, in which nodes and hyperedges represent the individuals and the relationships between the individuals, respectively. However, these models select old nodes based on preference attachment and ignore the effect of aggregation. In real life, friends of friends are more likely to form friendships with each other, and a social network should be a hypernetwork with an aggregation phenomenon. Therefore, a social hypernetwork evolution model with adjustable clustering coefficients is proposed. Subsequently, we use the SIS (susceptible–infectious–susceptible) model to describe the information propagation process in the aggregation-phenomenon hypernetwork. In addition, we establish the relationship between the density of informed nodes and the structural parameters of the hypernetwork in a steady state using the mean field theory. Notably, modifications to the clustering coefficients do not impact the hyperdegree distribution; however, an increase in the clustering coefficients results in a reduced speed of information dissemination. It is further observed that the model can degenerate to a BA (Barabási–Albert) hypernetwork by setting the clustering coefficient to zero. Thus, the aggregation-phenomenon hypernetwork is an extension of the BA hypernetwork with stronger applicability.
- Retracted
- 15 December 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (1) , 1-13
RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality
- 15 December 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (1) , 1-13
RetractedRETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality
- Open Access
- 31 July 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-6
Algebraic Connectivity and Disjoint Vertex Subsets of Graphs
It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.
- 31 July 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-6
Open AccessAlgebraic Connectivity and Disjoint Vertex Subsets of Graphs
It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.
- Open Access
- 30 November 2019
- Published by Wiley in Journal of Chemistry
- Vol. 2019, 1-7
The Exact Controllability of the Molecular Graph Networks
In this paper, we mainly study the exact controllability of several types of extended-path molecular graph networks. Based on the construction of extended-path molecular graph networks with , , or , using the determinant operation of the matrix and the recursive method, the exact characteristic polynomial of these networks is deduced. According to the definition of minimum driver node number , the exact controllability of these networks is obtained. Moreover, we give the minimum driver node sets of partial small networks.- 30 November 2019
- Published by Wiley in Journal of Chemistry
- Vol. 2019, 1-7
Open AccessThe Exact Controllability of the Molecular Graph Networks
In this paper, we mainly study the exact controllability of several types of extended-path molecular graph networks. Based on the construction of extended-path molecular graph networks with , , or , using the determinant operation of the matrix and the recursive method, the exact characteristic polynomial of these networks is deduced. According to the definition of minimum driver node number , the exact controllability of these networks is obtained. Moreover, we give the minimum driver node sets of partial small networks. - 1 April 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 203, 94-105
On the Estrada index of cactus graphs
- 1 April 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 203, 94-105
On the Estrada index of cactus graphs