Enhancement of Cooperation and Reentrant Phase of Prisoner’s Dilemma Game on Signed Networks

We studied the prisoner’s dilemma game as applied to signed networks. In signed networks, there are two types of links: positive and negative. To establish a payoff matrix between players connected with a negative link, we multiplied the payoff matrix between players connected with a positive link by −1. To investigate the effect of negative links on cooperating behavior, we performed simulations for different negative link densities. When the negative link density is low, the density of the cooperator becomes zero because there is an increasing temptation payoff, b. Here, parameter b is the payoff received by the defector from playing the game with a cooperator. Conversely, when the negative link density is high, the cooperator density becomes almost 1 as b increases. This is because players with a negative link will suffer more payoff damage if they do not cooperate with each other. The negative link forces players to cooperate, so cooperating behavior is enhanced.     

Research on China’s Risk of Housing Price Contagion Based on Multilayer Networks

The major issue in the evolution of housing prices is risk of housing price contagion. To model this issue, we constructed housing multilayer networks using transfer entropy, generalized variance decomposition, directed minimum spanning trees, and directed planar maximally filtered graph methods, as well as China’s comprehensive indices of housing price and urban real housing prices from 2012 to 2021. The results of our housing multilayer networks show that the topological indices (degree, PageRank, eigenvector, etc.) of new first-tier cities (Tianjin, Qingdao, and Shenyang) rank higher than those of conventional first-tier cities (Beijing, Shanghai, Guangzhou, and Shenzheng).     

基于多层神经网络的非线性图像分割

提出了一种用多层神经网络对图像进行非线性分割的方法。讨论了所用多层神经网络的学习速度的改进与训练样本的选择方法。实验表明，该多层神经网络系统可用于实时图像分割，并能获得很好的结果。     

Design and Implementation of a New Local Alignment Algorithm for Multilayer Networks

Network alignment (NA) is a popular research field that aims to develop algorithms for comparing networks. Applications of network alignment span many fields, from biology to social network analysis. NA comes in two forms: global network alignment (GNA), which aims to find a global similarity, and LNA, which aims to find local regions of similarity. Recently, there has been an increasing interest in introducing complex network models such as multilayer networks. Multilayer networks are common in many application scenarios, such as modelling of relations among people in a social network or representing the interplay of different molecules in a cell or different cells in the brain. Consequently, the need to introduce algorithms for the comparison of such multilayer networks, i.e., local network alignment, arises. Existing algorithms for LNA do not perform well on multilayer networks since they cannot consider inter-layer edges. Thus, we propose local alignment of multilayer networks (MultiLoAl), a novel algorithm for the local alignment of multilayer networks. We define the local alignment of multilayer networks and propose a heuristic for solving it. We present an extensive assessment indicating the strength of the algorithm. Furthermore, we implemented a synthetic multilayer network generator to build the data for the algorithm’s evaluation.     

Evolutionary Prisoners' Dilemma Game on Scale-Free Networks with Degree-Degree Correlation

Degree-degree correlation and heterogeneity in degree are important topological properties characterizing scale-free networks. We consider an evolutionary prisoners＇ dilemma game on scale-free networks and investigate how degree-degree correlation influences cooperation. It is found that the cooperator frequency displays resonance-like behavior with the variation of Pearson correlation coefficient. A measure on local heterogeneity in a network is proposed and it is realized that cooperation is proportional to the local heterogeneity.     

Microcanonical and Canonical Ensembles for fMRI Brain Networks in Alzheimer’s Disease

This paper seeks to advance the state-of-the-art in analysing fMRI data to detect onset of Alzheimer’s disease and identify stages in the disease progression. We employ methods of network neuroscience to represent correlation across fMRI data arrays, and introduce novel techniques for network construction and analysis. In network construction, we vary thresholds in establishing BOLD time series correlation between nodes, yielding variations in topological and other network characteristics. For network analysis, we employ methods developed for modelling statistical ensembles of virtual particles in thermal systems. The microcanonical ensemble and the canonical ensemble are analogous to two different fMRI network representations. In the former case, there is zero variance in the number of edges in each network, while in the latter case the set of networks have a variance in the number of edges. Ensemble methods describe the macroscopic properties of a network by considering the underlying microscopic characterisations which are in turn closely related to the degree configuration and network entropy. When applied to fMRI data in populations of Alzheimer’s patients and controls, our methods demonstrated levels of sensitivity adequate for clinical purposes in both identifying brain regions undergoing pathological changes and in revealing the dynamics of such changes.     

COVID-19’s Impact on International Trade

We analyze how the COVID-19 pandemic affected the trade of products between countries. With this aim, using the United Nations Comtrade database, we perform a Google matrix analysis of the multiproduct World Trade Network (WTN) for the years 2018–2020, comprising the emergence of the COVID-19 as a global pandemic. The applied algorithms—PageRank, CheiRank and the reduced Google matrix—take into account the multiplicity of the WTN links, providing new insights into international trade compared to the usual import–export analysis. These complex networks analysis algorithms establish new rankings and trade balances of countries and products considering all countries on equal grounds, independent of their wealth, and every product on the basis of its relative exchanged volumes. In comparison with the pre-COVID-19 period, significant changes in these metrics occurred for the year 2020, highlighting a major rewiring of the international trade flows induced by the COVID-19 pandemic crisis. We define a new PageRank–CheiRank product trade balance, either export or import-oriented, which is significantly perturbed by the pandemic.     

Inferring Users’ Social Roles with a Multi-Level Graph Neural Network Model

Users of social networks have a variety of social statuses and roles. For example, the users of Weibo include celebrities, government officials, and social organizations. At the same time, these users may be senior managers, middle managers, or workers in companies. Previous studies on this topic have mainly focused on using the categorical, textual and topological data of a social network to predict users’ social statuses and roles. However, this cannot fully reflect the overall characteristics of users’ social statuses and roles in a social network. In this paper, we consider what social network structures reflect users’ social statuses and roles since social networks are designed to connect people. Taking an Enron email dataset as an example, we analyzed a preprocessing mechanism used for social network datasets that can extract users’ dynamic behavior features. We further designed a novel social network representation learning algorithm in order to infer users’ social statuses and roles in social networks through the use of an attention and gate mechanism on users’ neighbors. The extensive experimental results gained from four publicly available datasets indicate that our solution achieves an average accuracy improvement of 2% compared with GraphSAGE-Mean, which is the best applicable inductive representation learning method.     

Prisoner's Dilemma Game on Clustered Scale-Free Networks under Different Initial Distributions

The evolutionary prisoner＇s dilemma game is investigated under different initial distributions for cooperators and defectors on scale-free networks with a tunable clustering coefficient. It is found that, on the one hand, cooperation can be enhanced with the increasing clustering coefficient when only the most connected nodes are occupied by cooperators initially. On the other hand, if cooperators just occupy the lowest-degree nodes at the beginning, then the higher the value of the clustering coefficient, the more unfavorable the environment for cooperators to survive for the increment of temptation to defect. Thereafter, we analytically argue these nontrivial phenomena by calculating the cooperation probability of the nodes with different degrees in the steady state, and obtain the critical values of initial frequency of cooperators below which cooperators would vanish finally for the two initial distributions.     

Effects of Dimers on Cooperation in the Spatial Prisoner's Dilemma Game

We investigate the evolutionary prisoner's dilemma game in structured populations by introducing dimers, which are defined as that two players in each dimer always hold a same strategy. We find that influences of dimers on cooperation depend on the type of dimers and the population structure. For those dimers in which players interact with each other, the cooperation level increases with the number of dimers though the cooperation improvement level
depends on the type of network structures. On the other hand, the dimers, in which there are not mutual interactions, will not do any good to the cooperation level in a single community, but interestingly, will improve the cooperation level in a population with two communities. We explore the relationship between dimers and self-interactions and find that the effects of dimers are similar to that of self-interactions. Also, we find that the dimers, which are established over two communities in a multi-community network, act as one type of interaction through which information between communities is communicated by the requirement that two players in a dimer hold a same strategy.     

Improvement of Contact Tracing with Citizen’s Distributed Risk Maps

The rapid spread of COVID-19 has demonstrated the need for accurate information to contain its diffusion. Technological solutions are a complement that can help citizens to be informed about the risk in their environment. Although measures such as contact traceability have been successful in some countries, their use raises society’s resistance. This paper proposes a variation of the consensus processes in directed networks to create a risk map of a determined area. The process shares information with trusted contacts: people we would notify in the case of being infected. When the process converges, each participant would have obtained the risk map for the selected zone. The results are compared with the pilot project’s impact testing of the Spanish contact tracing app (RadarCOVID). The paper also depicts the results combining both strategies: contact tracing to detect potential infections and risk maps to avoid movements into conflictive areas. Although some works affirm that contact tracing apps need 60% of users to control the propagation, our results indicate that a 40% could be enough. On the other hand, the elaboration of risk maps could work with only 20% of active installations, but the effect is to delay the propagation instead of reducing the contagion. With both active strategies, this methodology is able to significantly reduce infected people with fewer participants.     

Gene Network Analysis of Alzheimer’s Disease Based on Network and Statistical Methods

Gene network associated with Alzheimer’s disease (AD) is constructed from multiple data sources by considering gene co-expression and other factors. The AD gene network is divided into modules by Cluster one, Markov Clustering (MCL), Community Clustering (Glay) and Molecular Complex Detection (MCODE). Then these division methods are evaluated by network structure entropy, and optimal division method, MCODE. Through functional enrichment analysis, the functional module is identified. Furthermore, we use network topology properties to predict essential genes. In addition, the logical regression algorithm under Bayesian framework is used to predict essential genes of AD. Based on network pharmacology, four kinds of AD’s herb-active compounds-active compound targets network and AD common core network are visualized, then the better herbs and herb compounds of AD are selected through enrichment analysis.     

Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks

In this article, we investigate limitations of importing methods based on algorithmic information theory from monoplex networks into multidimensional networks (such as multilayer networks) that have a large number of extra dimensions (i.e., aspects). In the worst-case scenario, it has been previously shown that node-aligned multidimensional networks with non-uniform multidimensional spaces can display exponentially larger algorithmic information (or lossless compressibility) distortions with respect to their isomorphic monoplex networks, so that these distortions grow at least linearly with the number of extra dimensions. In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information distortions with respect to their isomorphic monoplex networks. However, unlike the node-aligned non-uniform case studied in previous work, these distortions in the node-unaligned case grow at least exponentially with the number of extra dimensions. On the other hand, for node-aligned multidimensional networks with uniform multidimensional spaces, we demonstrate that any distortion can only grow up to a logarithmic order of the number of extra dimensions. Thus, these results establish that isomorphisms between finite multidimensional networks and finite monoplex networks do not preserve algorithmic information in general and highlight that the algorithmic information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis.     

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi-Albert Networks with Degree-Dependent Guilt Mechanism

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi-Albert (BA) networks. In the model, each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents. Making an investment is costly, but which benefits its neighboring agents, where benefit and cost depend on the level of investment made. The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors. Not only payoff, individual's guilty emotion in the games has also been considered. The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly. We assume that the reduction amount depends on the individual's degree and a baseline level parameter. The group's cooperative level is characterized by the average investment of the population. Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step, his best history strategies in the latest steps which number is controlled by a memory length parameter, and a uniformly distributed random number. Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases. Imitation, memory, uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population. All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms.     

Detecting and Analyzing Politically-Themed Stocks Using Text Mining Techniques and Transfer Entropy—Focus on the Republic of Korea’s Case

Politically-themed stocks mainly refer to stocks that benefit from the policies of politicians. This study gave the empirical analysis of the politically-themed stocks in the Republic of Korea and constructed politically-themed stock networks based on the Republic of Korea’s politically-themed stocks, derived mainly from politicians. To select politically-themed stocks, we calculated the daily politician sentiment index (PSI), which means politicians’ daily reputation using politicians’ search volume data and sentiment analysis results from politician-related text data. Additionally, we selected politically-themed stock candidates from politician-related search volume data. To measure causal relationships, we adopted entropy-based measures. We determined politically-themed stocks based on causal relationships from the rates of change of the PSI to their abnormal returns. To illustrate causal relationships between politically-themed stocks, we constructed politically-themed stock networks based on causal relationships using entropy-based approaches. Moreover, we experimented using politically-themed stocks in real-world situations from the schematized networks, focusing on politically-themed stock networks’ dynamic changes. We verified that the investment strategy using the PSI and politically-themed stocks that we selected could benchmark the main stock market indices such as the KOSPI and KOSDAQ around political events.     

Training Multilayer Perceptron with Genetic Algorithms and Particle Swarm Optimization for Modeling Stock Price Index Prediction

Predicting stock market (SM) trends is an issue of great interest among researchers, investors and traders since the successful prediction of SMs’ direction may promise various benefits. Because of the fairly nonlinear nature of the historical data, accurate estimation of the SM direction is a rather challenging issue. The aim of this study is to present a novel machine learning (ML) model to forecast the movement of the Borsa Istanbul (BIST) 100 index. Modeling was performed by multilayer perceptron–genetic algorithms (MLP–GA) and multilayer perceptron–particle swarm optimization (MLP–PSO) in two scenarios considering Tanh (x) and the default Gaussian function as the output function. The historical financial time series data utilized in this research is from 1996 to 2020, consisting of nine technical indicators. Results are assessed using Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and correlation coefficient values to compare the accuracy and performance of the developed models. Based on the results, the involvement of the Tanh (x) as the output function, improved the accuracy of models compared with the default Gaussian function, significantly. MLP–PSO with population size 125, followed by MLP–GA with population size 50, provided higher accuracy for testing, reporting RMSE of 0.732583 and 0.733063, MAPE of 28.16%, 29.09% and correlation coefficient of 0.694 and 0.695, respectively. According to the results, using the hybrid ML method could successfully improve the prediction accuracy.     

Fidelity Mechanics: Analogues of the Four Thermodynamic Laws and Landauer’s Principle

Fidelity mechanics is formalized as a framework for investigating critical phenomena in quantum many-body systems. Fidelity temperature is introduced for quantifying quantum fluctuations, which, together with fidelity entropy and fidelity internal energy, constitute three basic state functions in fidelity mechanics, thus enabling us to formulate analogues of the four thermodynamic laws and Landauer’s principle at zero temperature. Fidelity flows, which are irreversible, are defined and may be interpreted as an alternative form of renormalization group flows. Thus, fidelity mechanics offers a means to characterize both stable and unstable fixed points: divergent fidelity temperature for unstable fixed points and zero-fidelity temperature and (locally) maximal fidelity entropy for stable fixed points. In addition, fidelity entropy behaves differently at an unstable fixed point for topological phase transitions and at a stable fixed point for topological quantum states of matter. A detailed analysis of fidelity mechanical-state functions is presented for six fundamental models—the quantum spin-1/2 XY model, the transverse-field quantum Ising model in a longitudinal field, the quantum spin-1/2 XYZ model, the quantum spin-1/2 XXZ model in a magnetic field, the quantum spin-1 XYZ model, and the spin-1/2 Kitaev model on a honeycomb lattice for illustrative purposes. We also present an argument to justify why the thermodynamic, psychological/computational, and cosmological arrows of time should align with each other, with the psychological/computational arrow of time being singled out as a master arrow of time.     

A Network Approach to the Study of the Dynamics of Risk Spillover in China’s Bond Market

Since 2018, the bond market has surpassed the stock market, becoming the biggest investment area in China’s security market, and the systemic risks of China’s bond market are of non-negligible importance. Based on daily interest rate data of representative bond categories, this study conducted a dynamic analysis based on generalized vector autoregressive volatility spillover variance decomposition, constructed a complex network, and adopted the minimum spanning tree method to clarify and analyze the risk propagation path between different bond types. It is found that the importance of each bond type is positively correlated with liquidity, transaction volume, and credit rating, and the inter-bank market is the most important market in the entire bond market, while interest rate bonds, bank bonds and urban investment bonds are important varieties with great systemic importance. In addition, the long-term trend of the dynamic spillover index of China’s bond market falls in line with the pace of the interest rate adjustments. To hold the bottom line of preventing financial systemic risks of China’s bond market, standard management, strict supervision, and timely regulation of the bond markets are required, and the structural entropy, as a useful indicator, also should be used in the risk management and monitoring.     

基于混沌人工蜂群算法的无线传感器网络覆盖优化

针对无线传感器网络随机播撒的节点严重冗余并且导致网络寿命短、覆盖效率不高等缺陷,提出了一种混沌人工蜂群算法的无线传感器网络覆盖优化算法;将节点的利用率和覆盖率作为优化目标函数,建立与之对应的数学模型,之后用混沌人工蜂群算法改善人工蜂群算法陷入局部最优、收敛慢等问题,提高算法收敛速度和精度,对节点覆盖模型进行求解,得出网络最优覆盖方案;通过实验仿真,提出的算法提高了无线传感器网络的覆盖率,覆盖率可达93.48%以上,减少了网络节点冗余,提高了网络寿命,降低了网络成本。     

基于级联神经网络的实用型三维复合不变性多目标识别

以三 飞机模型作为待识别目标,模型真实场景,对用于多目标分类识别的级联神经网络重新进行了研究。实验发现畜产品上降的主要原因是实际采集的目标发生的复杂畸变与计算机模拟产生的效果并不一样。用采集得到的目标图像作为训练样本,对网络重新构造和训练,取得了好的实验结果。分析了其中涉及到目标定位、图像分割等图像预处理问题,提出了一种基于二值图像开矿学腐蚀运算的快速目标检测位法,可快速有效地对目标进行检测定 。