Migration Networks Pattern of China’s Floating Population from the Perspective of Complex Network

Since China’s reform and opening-up,the growing disparity between urban and rural areas and regions has led to massive migration.With China’s Rural Revitalization Strategy and the industrial transfer from the eastern coastal areas to the inland,the migration direction and pattern of the floating population have undergone certain changes.Using the 2017 China Migrants Dynamic Survey(CMDS),excluding Hong Kong,Macao,and Taiwan regions of China,organized by China’s National Health Commission,the relationship matrix of the floating population is constructed according to the inflow place of the interviewees and their outflow place(the location of the registered residence)in the questionnaire survey.We then apply the complex network model to analyze the migration direction and network pattern of China’s floating population from the city scale.The migration network shows an obvious hierarchical agglomeration.The first-,second-,third-and fourth-tier distribution cities are municipalities directly under the central government,provincial capital cities,major cities in the central and western regions and ordinary cities in all provinces,respectively.The migration trend is from the central and western regions to the eastern coastal areas.The migration network has‘small world’characteristics,forming nine communities.It shows that most node cities in the same community are closely linked and geographically close,indicating that the migration network of floating population is still affected by geographical proximity.Narrowing the urban-rural and regional differences will promote the rational distribution this population.It is necessary to strengthen the reform of the registered residence system,so that the floating population can enjoy urban public services comparable to other populations,and allow migrants to live and work in peace.

A novel complex-high-order graph convolutional network paradigm:ChyGCN

In recent years,there has been a growing interest in graph convolutional networks(GCN).However,existing GCN and variants are predominantly based on simple graph or hypergraph structures,which restricts their ability to handle complex data correlations in practical applications.These limitations stem from the difficulty in establishing multiple hierarchies and acquiring adaptive weights for each of them.To address this issue,this paper introduces the latest concept of complex hypergraphs and constructs a versatile high-order multi-level data correlation model.This model is realized by establishing a three-tier structure of complexes-hypergraphs-vertices.Specifically,we start by establishing hyperedge clusters on a foundational network,utilizing a second-order hypergraph structure to depict potential correlations.For this second-order structure,truncation methods are used to assess and generate a three-layer composite structure.During the construction of the composite structure,an adaptive learning strategy is implemented to merge correlations across different levels.We evaluate this model on several popular datasets and compare it with recent state-of-the-art methods.The comprehensive assessment results demonstrate that the proposed model surpasses the existing methods,particularly in modeling implicit data correlations(the classification accuracy of nodes on five public datasets Cora,Citeseer,Pubmed,Github Web ML,and Facebook are 86.1±0.33,79.2±0.35,83.1±0.46,83.8±0.23,and 80.1±0.37,respectively).This indicates that our approach possesses advantages in handling datasets with implicit multi-level structures.

Identify information sources with different start times in complex networks based on sparse observers

The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.

Dynamic analysis of major public health emergency transmission considering the dual-layer coupling of community–resident complex networks

We construct a dual-layer coupled complex network of communities and residents to represent the interconnected risk transmission network between communities and the disease transmission network among residents. It characterizes the process of infectious disease transmission among residents between communities through the SE2IHR model considering two types of infectors. By depicting a more fine-grained social structure and combining further simulation experiments, the study validates the crucial role of various prevention and control measures implemented by communities as primary executors in controlling the epidemic. Research shows that the geographical boundaries of communities and the social interaction patterns of residents have a significant impact on the spread of the epidemic, where early detection, isolation and treatment strategies at community level are essential for controlling the spread of the epidemic. In addition, the study explores the collaborative governance model and institutional advantages of communities and residents in epidemic prevention and control.

Hydrocarbon gas huff-n-puff optimization of multiple horizontal wells with complex fracture networks in the M unconventional reservoir

The oil production of the multi-fractured horizontal wells(MFHWs) declines quickly in unconventional oil reservoirs due to the fast depletion of natural energy. Gas injection has been acknowledged as an effective method to improve oil recovery factor from unconventional oil reservoirs. Hydrocarbon gas huff-n-puff becomes preferable when the CO_(2) source is limited. However, the impact of complex fracture networks and well interference on the EOR performance of multiple MFHWs is still unclear. The optimal gas huff-n-puff parameters are significant for enhancing oil recovery. This work aims to optimize the hydrocarbon gas injection and production parameters for multiple MFHWs with complex fracture networks in unconventional oil reservoirs. Firstly, the numerical model based on unstructured grids is developed to characterize the complex fracture networks and capture the dynamic fracture features.Secondly, the PVT phase behavior simulation was carried out to provide the fluid model for numerical simulation. Thirdly, the optimal parameters for hydrocarbon gas huff-n-puff were obtained. Finally, the dominant factors of hydrocarbon gas huff-n-puff under complex fracture networks are obtained by fuzzy mathematical method. Results reveal that the current pressure of hydrocarbon gas injection can achieve miscible displacement. The optimal injection and production parameters are obtained by single-factor analysis to analyze the effect of individual parameter. Gas injection time is the dominant factor of hydrocarbon gas huff-n-puff in unconventional oil reservoirs with complex fracture networks. This work can offer engineers guidance for hydrocarbon gas huff-n-puff of multiple MFHWs considering the complex fracture networks.

Earthquake disaster chain model based on complex networks for urban engineering systems

According to news reports on severe earthquakes since 2008,a total of 51 cases with magnitudes of 6.0 or above were analyzed,and 14 frequently occurring secondary disasters were identified.A disaster chain model was developed using principles from complex network theory.The vulnerability and risk level of each edge in this model were calculated,and high-risk edges and disaster chains were identified.The analysis reveals that the edge“floods→building collapses”has the highest vulnerability.Implementing measures to mitigate this edge is crucial for delaying the spread of secondary disasters.The highest risk is associated with the edge“building collapses→casualties,”and increased risks are also identified for chains such as“earthquake→building collapses→casualties,”“earthquake→landslides and debris flows→dammed lakes,”and“dammed lakes→floods→building collapses.”Following an earthquake,the prompt implementation of measures is crucial to effectively disrupt these chains and minimize the damage from secondary disasters.

Target layer state estimation in multi-layer complex dynamical networks considering nonlinear node dynamics

In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.

Set-Membership Filtering Approach to Dynamic Event-Triggered Fault Estimation for a Class of Nonlinear Time-Varying Complex Networks

The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or not.To guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault signals.The aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid domains.The techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain conditions.Then,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then provided.Finally,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.

Discovering hidden information of gene ontology based on complex networks analysis

To resolve the ontology understanding problem, the structural features and the potential important terms of a large-scale ontology are investigated from the perspective of complex networks analysis. Through the empirical studies of the gene ontology with various perspectives, this paper shows that the whole gene ontology displays the same topological features as complex networks including ＂small world＂ and ＂scale-free＂,while some sub-ontologies have the ＂scale-free＂ property but no ＂small world＂ effect.The potential important terms in an ontology are discovered by some famous complex network centralization methods.An evaluation method based on information retrieval in MEDLINE is designed to measure the effectiveness of the discovered important terms.According to the relevant literature of the gene ontology terms,the suitability of these centralization methods for ontology important concepts discovering is quantitatively evaluated.The experimental results indicate that the betweenness centrality is the most appropriate method among all the evaluated centralization measures.

Evolution, resilience and causes of global petroleum gas trade networks: 1995-2020

Based on the HS 4-digit code trade data in UNCOMTRADE from 1995 to 2020, this paper analyzes the characteristics of the evolution of the global PG trade network using the complex network approach and analyzes the changes in its resilience at the overall and country levels, respectively. The results illustrated that:(1) The scale of the global PG trade network tends to expand, and the connection is gradually tightened, experiencing a change from a “supply-oriented” to a “supply-and-demand” pattern, in which the U.S., Russia, Qatar, and Australia have gradually replaced Canada, Japan, and Russia to become the core trade status, while OPEC countries such as Qatar, Algeria, and Kuwait mainly rely on PG exports to occupy the core of the global supply, and the trade status of other countries has been dynamically alternating and evolving.(2) The resilience of the global PG trade network is lower than that of the random network and decreases non-linearly with more disrupted countries. Moreover, the impact of the U.S. is more significant than the rest of countries. Simulations using the exponential random graph model(ERGM) model revealed that national GDP, institutional quality, common border and RTA network are the determinants of PG trade network formation, and the positive impact of the four factors not only varies significantly across regions and stages, but also increases with national network status.

Pinning-controlled synchronization of complex networks with bounded or unbounded synchronized regions

This paper studies pinning-controlled synchronization of complex networks with bounded or unbounded synchronized regions. To study a state-feedback pinning-controlled network with N nodes, it first converts the controlled network to an extended network of N＋1 nodes without controls. It is shown that the controlled synchronizability of the given network is determined by the real part of the smallest nonzero eigenvalue of the coupling matrix of its extended network when the synchronized region is unbounded; but it is determined by the ratio of the real parts of the largest and the smallest nonzero eigenvalues of the coupling matrix when the synchronized region is bounded. Both theoretical analysis and numerical simulation show that the portion of controlled nodes has no critical values when the synchronized region is unbounded, but it has a critical value when the synchronized region is bounded. In the former case, therefore, it is possible to control the network to achieve synchronization by pinning only one node. In the latter case, the network can achieve controlled synchronization only when the portion of controlled nodes is larger than the critical value.

Chaos in complex motor networks induced by Newman-Watts small-world connections

We investigate how dynamical behaviours of complex motor networks depend on the Newman-Watts small-world （NWSW） connections. Network elements are described by the permanent magnet synchronous motor （PMSM） with the values of parameters at which each individual PMSM is stable. It is found that with the increase of connection probability p, the motor in networks becomes periodic and falls into chaotic motion as p further increases. These phenomena imply that NWSW connections can induce and enhance chaos in motor networks. The possible mechanism behind the action of NWSW connections is addressed based on stability theory.

Circulation system complex networks and teleconnections

In terms of the characteristic topology parameters of climate complex networks, the spatial connection structural complexity of the circulation system and the influence of four teleconnection patterns are quantitatively described. Results of node degrees for the Northern Hemisphere （NH） mid-high latitude （30° N-90°N） circulation system （NHS） networks with and without the Arctic Oscillations （AO）, the North Atlantic Oscillations （NAO） and the Pacific-North American pattern （PNA） demonstrate that the teleconnections greatly shorten the mean shortest path length of the networks, thus being advantageous to the rapid transfer of local fluctuation information over the network and to the stability of the NHS. The impact of the AO on the NHS connection structure is most important and the impact of the NAO is the next important. The PNA is a relatively independent teleconnection, and its role in the NHS is mainly manifested in the connection between the NHS and the tropical circulation system （TRS）. As to the Southern Hemisphere mid-high latitude （30°S-90°S） circulation system （SHS）, the impact of the Antarctic Arctic Oscillations （AAO） on the structural stability of the system is most important. In addition, there might be a stable correlation dipole （AACD） in the SHS, which also has important influence on the structure of the SHS networks.

Joint optimization scheduling for water conservancy projects incomplex river networks

In this study, we simulated water flow in a water conservancy project consisting of various hydraulic structures, such as sluices, pumping stations, hydropower stations, ship locks, and culverts, and developed a multi-period and multi-variable joint optimization scheduling model for flood control, drainage, and irrigation. In this model, the number of sluice holes, pump units, and hydropower station units to be opened were used as decision variables, and different optimization objectives and constraints were considered. This model was solved with improved genetic algorithms and verified using the Huaian Water Conservancy Project as an example. The results show that the use of the joint optimization scheduling led to a 10% increase in the power generation capacity and a 15% reduction in the total energy consumption. The change in the water level was reduced by 0.25 m upstream of the Yundong Sluice, and by 50% downstream of pumping stations No. 1, No. 2, and No. 4. It is clear that the joint optimization scheduling proposed in this study can effectively improve power generation capacity of the project, minimize operating costs and energy consumption, and enable more stable operation of various hydraulic structures. The results may provide references for the management of water conservancy projects in complex river networks.

Normalized entropy of rank distribution： a novel measure of heterogeneity of complex networks

Many unique properties of complex networks result from heterogeneity. The measure and analysis of heterogeneity are important and desirable to the research of the properties and functions of complex networks. In this paper, the rank distribution is proposed as a new statistic feature of complex networks. Based on the rank distribution, a novel measure of the heterogeneity called a normalized entropy of rank distribution （NERD） is proposed. The NERD accords with the normal meaning of heterogeneity within the context of complex networks compared with conventional measures. The heterogeneity of scale-free networks is studied using the NERD. It is shown that scale-free networks become more heterogeneous as the scaling exponent decreases and the NERD of scale-free networks is independent of the number of vertices, which indicates that the NERD is a suitable and effective measure of heterogeneity for networks with different sizes.

Evidential method to identify influential nodes in complex networks

Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.

Identifying influential spreaders in complex networks based on entropy weight method and gravity law

In complex networks,identifying influential spreader is of great significance for improving the reliability of networks and ensuring the safe and effective operation of networks.Nowadays,it is widely used in power networks,aviation networks,computer networks,and social networks,and so on.Traditional centrality methods mainly include degree centrality,closeness centrality,betweenness centrality,eigenvector centrality,k-shell,etc.However,single centrality method is onesided and inaccurate,and sometimes many nodes have the same centrality value,namely the same ranking result,which makes it difficult to distinguish between nodes.According to several classical methods of identifying influential nodes,in this paper we propose a novel method that is more full-scaled and universally applicable.Taken into account in this method are several aspects of node’s properties,including local topological characteristics,central location of nodes,propagation characteristics,and properties of neighbor nodes.In view of the idea of the multi-attribute decision-making,we regard the basic centrality method as node’s attribute and use the entropy weight method to weigh different attributes,and obtain node’s combined centrality.Then,the combined centrality is applied to the gravity law to comprehensively identify influential nodes in networks.Finally,the classical susceptible-infected-recovered(SIR)model is used to simulate the epidemic spreading in six real-society networks.Our proposed method not only considers the four topological properties of nodes,but also emphasizes the influence of neighbor nodes from the aspect of gravity.It is proved that the new method can effectively overcome the disadvantages of single centrality method and increase the accuracy of identifying influential nodes,which is of great significance for monitoring and controlling the complex networks.

A dynamic epidemic control model on uncorrelated complex networks

In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptible-infectedrecovered （SIR） model on the above networks, but it can reduce the prevalence of the infected individuals remarkably. This result may help us understand epidemic spreading phenomena on real networks and design appropriate strategies to control infections.

Dynamic analysis of a sexually transmitted disease model on complex networks

In this paper,a sexually transmitted disease model is proposed on complex networks,where contacts between humans are treated as a scale-free social network.There are three groups in our model,which are dangerous male,non-dangerous male,and female.By mathematical analysis,we obtain the basic reproduction number for the existence of endemic equilibrium and study the effects of various immunization schemes about different groups.Furthermore,numerical simulations are undertaken to verify more conclusions.

Topology identification for a class of complex dynamical networks using output variables

A problem of topology identification for complex dynamical networks is investigated in this paper. An adaptive observer is proposed to identify the topology of a complex dynamical networks based on the Lyapunov stability theory. Here the output of the network and the states of the observer are used to construct the updating law of the topology such that the communication resources from the network to its observer are saved. Some convergent criteria of the adaptive observer are derived in the form of linear inequality matrices. Several numerical examples are shown to demonstrate the effectiveness of the proposed observer.