Xiaomin Wang

Ms. Xiaomin Wang

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 January 2020 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
FMFei Ma
Fei Ma
XWXiaomin Wang
Xiaomin Wang
PWPing Wang
Ping Wang
Degree distribution, or equivalently called degree sequence, has been commonly used to study a large number of complex networks in the past few years. This reveals some intriguing results, for instance, the popularity of power-law distribution in most of these networks under consideration. Along such a research line, in this paper, we generate an ensemble of random graphs with an identical degree distribution P ( k ) ∼ k − γ ( γ = 3 ) as proved shortly, denoted as graph space N ( p , q , t ) , where probability parameters p and q hold on p + q = 1 . Next, we study some topological structure properties of great interest on each member in the graph space N ( p , q , t ) using both precisely analytical calculations and extensively numerical simulations, as follows. From the theoretical point of view, given an ultrasmall constant p c , perhaps only the graph model N ( 1 , 0 , t ) is small-world and the others are not in terms of diameter. Then, we obtain exact solutions for a spanning tree number on two deterministic graph models in the graph space N ( p , q , t ) , which gives both upper bound and lower bound for that of other members. Meanwhile, for an arbitrary p ( ≠ 1 ), we prove using the Pearson correlation coefficient that the graph model N ( p , q , t ) does go through two phase transitions over time, i.e., starting by a nonassortative pattern, then suddenly going into a disassortative region, and gradually converging to an initial position (nonassortative point). Therefore, to some extent, the three topological parameters above can serve as the complementary measures for degree distribution to help us clearly distinguish all members in the graph space N ( p , q , t ) . In addition, one “null” graph model is built.

26 May 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
FMFei Ma
Fei Ma
XWXiaomin Wang
Xiaomin Wang
PWPing Wang
Ping Wang
XLXudong Luo
Xudong Luo
While previous works have shown that an overwhelming number of scale-free networks are sparse, there still exist some real-world networks including social networks, urban networks, information networks, which are by observation dense. In this paper, we propose a framework for generating scale-free graphs with a dense feature using two simple yet helpful operations: first-order subdivision and line operation. From the theoretical point of view, our method can be used not only to produce desired scale-free graphs with a density feature, i.e., a power-law exponent γ falling into the interval 1<γ≤2, but also to establish many other unexpected networked models, for instance, power-law models having a large diameter. In addition, the networked models generated upon our framework show an especially assortative structure. That is, their own Pearson correlation coefficients are able to achieve the theoretical upper bound. Last but not the least, we find the sizes of community in the proposed models to follow the power law in a form with respect to modularity maximization.

25 February 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
FMFei Ma
Fei Ma
XWXiaomin Wang
Xiaomin Wang
PWPing Wang
Ping Wang
Here, we propose a class of scale-free networks G(t;m) with intriguing properties, which cannot be simultaneously held by all the theoretical models with power-law degree distribution in the existing literature, including the following: (i) average degrees 〈k〉 of all the generated networks are no longer constant in the limit of large graph size, implying that they are not sparse but dense; (ii) power-law parameters γ of these networks are precisely calculated equal to 2; and (iii) their diameters D are all invariant in the growth process of models. While our models have deterministic structure with clustering coefficients equivalent to zero, we might be able to obtain various candidates with nonzero clustering coefficients based on original networks using reasonable approaches, for instance, randomly adding new edges under the premise of keeping the three important properties above unchanged. In addition, we study the trapping problem on networks G(t;m) and then obtain a closed-form solution to mean hitting time 〈H〉t. As opposed to other previous models, our results show an unexpected phenomenon that the analytic value for 〈H〉t is approximately close to the logarithm of the vertex number of networks G(t;m). From the theoretical point of view, these networked models considered here can be thought of as counterexamples for most of the published models obeying power-law distribution in current study.

1 January 2007 in Acta Physica Sinica
Verified
Journal Article
Open access
PDF file
LYLiu Yun
Liu Yun
ZXZhang Xiong
Zhang Xiong
ZYZheng Yong-Gang
Zheng Yong-Gang
XWXiaomin Wang
Xiaomin Wang
BYBao Yu-Ying
Bao Yu-Ying
云南云南师范大学物理与电子信息学院,昆明650092
云南师范大学物理与电子信息学院,昆明650092
从已有文献中收集了一定数量的有关Blazar天体的数据,分析光变、偏振度以及核优参数之间的相关性,结果表明光变和偏振及核优参数之间有一定的关系,这可能暗示Blazar天体存在着聚束效应.

1 April 2020 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
XWXiaomin Wang
Xiaomin Wang
FMFei Ma
Fei Ma
Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a large variety of complex networks, in which some are deterministic and others are random. The goal of this paper is to generate a class of random scale-free networks. To achieve this, we introduce three types of operations, i.e., rectangle operation, diamond operation, and triangle operation, and provide the concrete process for generating random scale-free networks N ( p , q , r , t ) , where probability parameters p , q , r hold on p + q + r = 1 with 0 ≤ p , q , r ≤ 1 . We then discuss their topological properties, such as average degree, degree distribution, diameter, and clustering coefficient. First, we calculate the average degree of each member and discover that each member is a sparse graph. Second, by computing the degree distribution of our network N ( p , q , r , t ) , we find that degree distribution obeys the power-law distribution, which implies that each member is scale-free. Next, according to our analysis of the diameter of our network N ( p , q , r , t ) , we reveal the fact that the diameter may abruptly transform from small to large. Afterward, we give the calculation process of the clustering coefficient and discover that its value is mainly determined by r .

9 May 2022 in Journal of the Franklin Institute
Verified
Journal Article
Closed access
JHJian Hou
Jian Hou
ZCZhiyong Chen
Zhiyong Chen
MZMingyue Zhang
Mingyue Zhang
XWXiaomin Wang
Xiaomin Wang