Rui-Jie Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rui-Jie Wu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Gui-Yuan Shi
3 shared publicationsYi-Xiu Kong
3 shared publications- Yixiu Kong
Beijing University of Posts and Telecommunications
3 shared publications Bo-Lun Chen
College of Computer Engineering Huaiyin Institute of Technology 233003 Huaian PR China
2 shared publications- Guanghui Yuan
School of economics and management, Shanghai University of Political Science and Law, Shanghai 201701, China
2 shared publications - Gui-Yuan Shi
Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University, Guangdong, Zhuhai, 519087, China
2 shared publications
Latest Publications
- 5 March 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 208
A fast algorithm for estimating the maximum k-core number in random graphs with given expected degree sequences
- 5 March 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 208
A fast algorithm for estimating the maximum k-core number in random graphs with given expected degree sequences
- Open Access
- 14 January 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (1)
An evolution model for the mobility of urban societal classes based on complex networks
Cities serve as the main platform for human socio-economic activities, where large crowds, products, and information converge, forming complex societal interactions and the space for human to interact with each other. Like traditional geographical space, in cities, cyberspace and societal space also offer diverse channels for human interactions. While urban mobility in geographical space has been extensively studied across disciplines such as geography, economics, transportation and human behavior, mobility within societal space in cities has rarely been examined in depth. This paper focuses on the self-organized consolidation of mobility within urban societal spaces. Based on the rational person hypothesis and Dunbar's number, we construct a simple model to explain why urban societal classes spontaneously emerge in the evolution of societal space. We also find that the mobility within urban societal space decreases spontaneously over time, and eventually outstanding individuals potentially can be trapped in lower classes, resulting in an inefficient matching of urban resources.
- 14 January 2025
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 6 (1)
Open AccessAn evolution model for the mobility of urban societal classes based on complex networks
Cities serve as the main platform for human socio-economic activities, where large crowds, products, and information converge, forming complex societal interactions and the space for human to interact with each other. Like traditional geographical space, in cities, cyberspace and societal space also offer diverse channels for human interactions. While urban mobility in geographical space has been extensively studied across disciplines such as geography, economics, transportation and human behavior, mobility within societal space in cities has rarely been examined in depth. This paper focuses on the self-organized consolidation of mobility within urban societal spaces. Based on the rational person hypothesis and Dunbar's number, we construct a simple model to explain why urban societal classes spontaneously emerge in the evolution of societal space. We also find that the mobility within urban societal space decreases spontaneously over time, and eventually outstanding individuals potentially can be trapped in lower classes, resulting in an inefficient matching of urban resources.
- Open Access
An Analytical Solution to the $k$-core Pruning Process
$k$-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 $k$ are recursively removed. Although the simplicity and effectiveness of this method facilitate its implementation on broad applications across many scientific fields, it produces few analytical results. We here simplify the existing theoretical framework to a simple iterative relationship and obtain the exact analytical solutions of the $k$-core pruning process on large uncorrelated networks. From these solutions we obtain such statistical properties as the degree distribution and the size of the remaining subgraph in each of the pruning steps. Our theoretical results resolve the long-lasting puzzle of the $k$-core pruning dynamics and provide an intuitive description of the dynamic process.Open AccessAn Analytical Solution to the $k$-core Pruning Process
$k$-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 $k$ are recursively removed. Although the simplicity and effectiveness of this method facilitate its implementation on broad applications across many scientific fields, it produces few analytical results. We here simplify the existing theoretical framework to a simple iterative relationship and obtain the exact analytical solutions of the $k$-core pruning process on large uncorrelated networks. From these solutions we obtain such statistical properties as the degree distribution and the size of the remaining subgraph in each of the pruning steps. Our theoretical results resolve the long-lasting puzzle of the $k$-core pruning dynamics and provide an intuitive description of the dynamic process. - Open Access
Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
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 importance to the centralized match maker, a very large number of questions have been extensively studied in this field. This article considers a generalized form of stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single is inevitable. Theoretical analysis and numerical simulations confirm that even small deviations from equal number of two sides can have a large impact on matching solution of Gale-Shapley Algorithm. These results provide insights to many of the real-world applications when matching two sides with unequal number.
Open AccessInstability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
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 importance to the centralized match maker, a very large number of questions have been extensively studied in this field. This article considers a generalized form of stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single is inevitable. Theoretical analysis and numerical simulations confirm that even small deviations from equal number of two sides can have a large impact on matching solution of Gale-Shapley Algorithm. These results provide insights to many of the real-world applications when matching two sides with unequal number.
- Open Access
- 1 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
Competition May Increase Social Utility in Bipartite Matching Problem
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 phenomena. In this article, we study the effect of competition on bipartite matching problem by introducing conformity into the preference structure. The results show that a certain amount of competition can improve the overall utility of society and also eliminate the giant shift of social utility when matching unequal numbers of men and women.
- 1 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
Open AccessCompetition May Increase Social Utility in Bipartite Matching Problem
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 phenomena. In this article, we study the effect of competition on bipartite matching problem by introducing conformity into the preference structure. The results show that a certain amount of competition can improve the overall utility of society and also eliminate the giant shift of social utility when matching unequal numbers of men and women.
- Open Access
- 1 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
The goal of the stable marriage problem is to match by pair two sets composed by the same number of elements. Due to its widespread applications in the real world, especially the unique importance to the centralized matchmaker, a very large number of questions have been extensively studied in this field. This article considers a generalized form of the stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single men or women is inevitable. Theoretical analysis and numerical simulations confirm that even a small deviation on the number of men and women from the equality condition can have a large impact on the matching solution of the Gale‐Shapley algorithm. These results provide insights to many of the real‐world applications when matching two sides with an unequal number.
- 1 January 2018
- Published by Wiley in Complexity
- Vol. 2018 (1)
Open AccessInstability in Stable Marriage Problem: Matching Unequally Numbered Men and Women
The goal of the stable marriage problem is to match by pair two sets composed by the same number of elements. Due to its widespread applications in the real world, especially the unique importance to the centralized matchmaker, a very large number of questions have been extensively studied in this field. This article considers a generalized form of the stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single men or women is inevitable. Theoretical analysis and numerical simulations confirm that even a small deviation on the number of men and women from the equality condition can have a large impact on the matching solution of the Gale‐Shapley algorithm. These results provide insights to many of the real‐world applications when matching two sides with an unequal number.