Yongxiang Xia

Prof. Dr. Yongxiang Xia


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
18 May 2017 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
ZCZhenhao Chen
Zhenhao Chen
Jiajing WuJiajing Wu
Jiajing Wu
YXYongxiang Xia
Yongxiang Xia
XZXi Zhang
Xi Zhang
In this brief, by considering realistic network operational settings, we propose a novel model to investigate the cascading failures in interdependent power grids and communication networks. We perform a critical node analysis on single networks to identify the vital nodes from the perspective of network robustness. Moreover, we assess the robustness of an interdependent system composed of an Internet AS-level network and the IEEE 118 Bus. Our simulation results show that assortative coupling of node destructiveness is more robust for densely coupled networks, whereas disassortative coupling of node robustness and node destructiveness performs better for sparsely coupled cases.

10 September 2014 in PLOS ONE
Verified
Journal Article
Open access
PDF file
FTFei Tan
Fei Tan
YXYongxiang Xia
Yongxiang Xia
BZBoyao Zhu
Boyao Zhu
Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further boost the discriminative resolution of candidate links. In this paper, we reexamine the role of network topology in predicting missing links from the perspective of information theory, and present a practical approach based on the mutual information of network structures. It not only can improve the prediction accuracy substantially, but also experiences reasonable computing complexity.

5 February 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CFChenbo Fu
Chenbo Fu
MZMinghao Zhao
Minghao Zhao
LFLu Fan
Lu Fan
XCXinyi Chen
Xinyi Chen
JCJinyin Chen
Jinyin Chen
QXQi Xuan
Qi Xuan
Real-world networks feature weights of interactions, where link weights often represent some physical attributes. In many situations, to recover the missing data or predict the network evolution, we need to predict link weights in a network. In this paper, we first proposed a series of new centrality indices for links in line graph. Then, utilizing these line graph indices, as well as a number of original graph indices, we designed three supervised learning methods to realize link weight prediction both in the networks of single layer and multiple layers, which perform much better than several recently proposed baseline methods. We found that the resource allocation index (RA) plays a more important role in the weight prediction than other topological properties, and the line graph indices are at least as important as the original graph indices in link weight prediction. In particular, the success application of our methods on Yelp layered network suggests that we can indeed predict the offline co-foraging behaviors of users just based on their online social interactions, which may open a new direction for link weight prediction algorithms, and meanwhile provide insights to design better restaurant recommendation systems.

25 June 2014 in Physical Review E
Verified
Journal Article
Closed access
PDF file
FTFei Tan
Fei Tan
JWJiajing Wu
Jiajing Wu
YXYongxiang Xia
Yongxiang Xia
CTChi K. Tse
Chi K. Tse
Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is still relatively unexplored. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected Barabási–Albert scale-free networks. We find that assortative coupling can alleviate traffic congestion more readily than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet autonomous-system-level graphs of South Korea and Japan and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnected networks accordingly.

3 September 2015 in Scientific Reports
Verified
Journal Article
Open access
BZBoyao Zhu
Boyao Zhu
YXYongxiang Xia
Yongxiang Xia
Various structural features of networks have been applied to develop link prediction methods. However, because different features highlight different aspects of network structural properties, it is very difficult to benefit from all of the features that might be available. In this paper, we investigate the role of network topology in predicting missing links from the perspective of information theory. In this way, the contributions of different structural features to link prediction are measured in terms of their values of information. Then, an information-theoretic model is proposed that is applicable to multiple structural features. Furthermore, we design a novel link prediction index, called Neighbor Set Information (NSI), based on the information-theoretic model. According to our experimental results, the NSI index performs well in real-world networks, compared with other typical proximity indices.

3 May 2018 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
HTHaicheng Tu
Haicheng Tu
YXYongxiang Xia
Yongxiang Xia
Herbert Ho-Ching IuHerbert Ho-Ching Iu
Herbert Ho-Ching Iu
XCXi Chen
Xi Chen
In recent years, the frequent occurrences of large-scale blackouts highlight the necessity of enhancing the robustness of power grids. In this paper, based on the cascading failure model which considers both the network topology and electrical characteristics running in power grids, we study how the topological metrics affect the robustness of power grids. The topological metrics considered include both the connectivity of the network and the distribution of generators. We compare the results in typical complex network models and IEEE 118-bus network. Moreover, by using the simulated annealing method, we find the optimal network topology to achieve the best network robustness, and compare the topological metrics before and after the optimization to verify our findings. The results show that in order to enhance the robustness of power grids, it is better to make the network sparsely connected, and place the generators as hubs and decentralize these generators.