arXiv subjects

Rui-Jie Wu

Publications and source records attributed to Rui-Jie Wu.

5 recordsLinked to original sources

arXiv2020

From spherical chicken to the tipping points of a complex network

The outbreak of epidemics, the emergence of the financial crisis, the collapse of ecosystem, and the explosive spreading of rumors, we face many challenges in today's world. These real-world problems can be abstracted into a sequential break down of a complex system in an increasingly stressful environment. Because both the system and the environment require a large number of parameters to describe, the break down conditions has been difficult to estimate. We use a highly symmetric system to gauge a complex environment, which enables us to propose a scalar benchmark to describe the environment. This allows us to prove that all the tipping points of a complex network fall between the maximum k-core and maximum eigenvalue of the network.

physics.soc-ph↗

arXiv2020

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.

physics.soc-ph↗

arXiv2018

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.

physics.soc-ph↗

arXiv2018

Competition May Increase Social Happiness 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 correlated wish list. The results show that proper competition can improve the overall happiness of society and also reduce the instability of the matching result of unequal sized bipartite matching.

physics.soc-ph↗

arXiv2016

The mathematics of non-linear metrics for nested networks

Numerical analysis of data from international trade and ecological networks has shown that the non-linear fitness-complexity metric is the best candidate to rank nodes by importance in bipartite networks that exhibit a nested structure. Despite its relevance for real networks, the mathematical properties of the metric and its variants remain largely unexplored. Here, we perform an analytic and numeric study of the fitness-complexity metric and a new variant, called minimal extremal metric. We rigorously derive exact expressions for node scores for perfectly nested networks and show that these expressions explain the non-trivial convergence properties of the metrics. A comparison between the fitness-complexity metric and the minimal extremal metric on real data reveals that the latter can produce improved rankings if the input data are reliable.

econ.GN↗