28 citations · 35 across the 8 of their papers we have counts for
5 papers · 1 filter
Analytical Results of k-core Pruning Process on Multi-layer Networks
Rui-jie Wu, Yi-Xiu Kong, Gui-Yuan Shi +1
Multi-layer networks or multiplex networks are generally considered as the networks that have the same set of vertices but different types of edges. Multi-layer networks are especi…
Using NonBacktracking Expansion to Analyze k-core Pruning Process
Rui-jie Wu, Yi-Xiu Kong, Gui-yuan Shi +1
We induce the NonBacktracking Expansion Branch method to analyze the k-core pruning process on the monopartite graph G which does not contain any self-loop or multi-edge. Different…
An Analytical Solution to the -core Pruning Process
Gui-Yuan Shi, Rui-Jie Wu, Yi-Xiu Kong +2
-core decomposition is widely used to identify the center of a large network, it is a pruning process in which the nodes with degrees less than are recursively removed. Alth…
Competition May Increase Social Happiness in Bipartite Matching Problem
Yi-Xiu Kong, Guang-Hui Yuan, Lei Zhou +2
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenome…
Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
Gui-Yuan Shi, Yi-Xiu Kong, Bo-Lun Chen +2
The Stable Marriage Problem is to find a one-to-one matching for two equally sized sets of agents. Due to its widespread applications in the real world, especially the unique impor…