1 citations · 2 across the 6 of their papers we have counts for
6 papers
Locating the eigenshield of a network via perturbation theory
Ming-Yang Zhou, Manuel Sebastian Mariani, Hao Liao +2
The functions of complex networks are usually determined by a small set of vital nodes. Finding the best set of vital nodes (eigenshield nodes) is critical to the network's robustn…
Addressing Time Bias in Bipartite Graph Ranking for Important Node Identification
Hao Liao, Jiao Wu, Mingyang Zhou +1
The goal of the ranking problem in networks is to rank nodes from best to worst, according to a chosen criterion. In this work, we focus on ranking the nodes according to their qua…
Learning the optimally coordinated routes from the statistical mechanics of polymers
Hao Liao, Xingtong Wu, Mingyang Zhou +1
Many major cities suffer from severe traffic congestion. Road expansion in the cites is usually infeasible, and an alternative way to alleviate traffic congestion is to coordinate…
Temporal similarity metrics for latent network reconstruction: The role of time-lag decay
Hao Liao, Ming-Kai Liu, Manuel Sebastian Mariani +2
When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hi…
Enhancing countries' fitness with recommender systems on the international trade network
Hao Liao, Xiao-Min Huang, Xing-Tong Wu +4
Prediction is one of the major challenges in complex systems. The prediction methods have shown to be effective predictors of the evolution of networks. These methods can help poli…
Analysis of ground state in random bipartite matching
Gui-Yuan Shi, Yi-Xiu Kong, Hao Liao +1
In human society, a lot of social phenomena can be concluded into a mathematical problem called the bipartite matching, one of the most well known model is the marriage problem pro…