Liang Wei

Liang Wei

Auto-generated profile, based on publicly available information

Liang Wei

The State Key Laboratory of Tibetan Intelligence, Qinghai Normal University , Xining 810008, Qinghai

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PLPengyue Li
Pengyue Li
LWLiang Wei
Liang Wei
HDHaiping Ding
Haiping Ding
FLFaxu Li
Faxu Li
Feng HuFeng Hu
Feng Hu
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.

20 December 2018 in Mathematics
Verified
Journal Article
Open access
PDF file
KZKe Zhang
Ke Zhang
HZHaixing Zhao
Haixing Zhao
ZYZhonglin Ye
Zhonglin Ye
YZYu Zhu
Yu Zhu
LWLiang Wei
Liang Wei
A hypergraph H = ( V , ε ) is a pair consisting of a vertex set V , and a set ε of subsets (the hyperedges of H ) of V . A hypergraph H is r -uniform if all the hyperedges of H have the same cardinality r . Let H be an r -uniform hypergraph, we generalize the concept of trees for r -uniform hypergraphs. We say that an r -uniform hypergraph H is a generalized hypertree ( G H T ) if H is disconnected after removing any hyperedge E , and the number of components of G H T − E is a fixed value k   ( 2 ≤ k ≤ r ) . We focus on the case that G H T − E has exactly two components. An edge-minimal G H T is a G H T whose edge set is minimal with respect to inclusion. After considering these definitions, we show that an r -uniform G H T on n vertices has at least 2 n / ( r + 1 ) edges and it has at most n − r + 1 edges if r ≥ 3   and   n ≥ 3 , and the lower and upper bounds on the edge number are sharp. We then discuss the case that G H T − E has exactly k   ( 2 ≤ k ≤ r − 1 ) components.

30 November 2019 in Journal of Chemistry
Verified
Journal Article
Open access
PDF file
LWLiang Wei
Liang Wei
FLFaxu Li
Faxu Li
HZHaixing Zhao
Haixing Zhao
BDBo Deng
Bo Deng
ZYZhonglin Ye
Zhonglin Ye
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 C3, C4, or K4, 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 ND, the exact controllability of these networks is obtained. Moreover, we give the minimum driver node sets of partial small networks.

3 April 2024 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
LWLiang Wei
Liang Wei
FLFaxu Li
Faxu Li
HZHaixing Zhao
Haixing Zhao
BDBo Deng
Bo Deng


2 November 2025 in The Computer Journal
Verified
Journal Article
Closed access
ZCZhenfu Chen
Zhenfu Chen
JLJinyang Lv
Jinyang Lv
LWLiang Wei
Liang Wei
FLFaxu Li
Faxu Li
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.