Searcharxiv⌕ Search

arXiv subjects

Wen-Xu Wang

Publications and source records attributed to Wen-Xu Wang.

At least 37 records · Page 2Linked to original sources
arXiv2011

Controllability of Complex Networks with Nonlinear Dynamics

Sun et al. provided an insightful comment arXiv:1108.5739v1 on our manuscript entitled "Controllability of Complex Networks with Nonlinear Dynamics" on arXiv. We agree on their main point that linearization about locally desired states can be violated in general by the breakdown of local control of the linearized complex network with nonlinear state. Therefore, we withdraw our manuscript. However, other than nonlinear dynamics, our claim that a single-node-control can fully control the general bidirectional/undirected linear network with 1D self-dynamics is still valid, which is similar to (but different from) the conclusion of arXiv:1106.2573v3 that all-node-control with a single signal can fully control any direct linear network with nodal-dynamics (1D self-dynamics).

cond-mat.dis-nn↗
arXiv2011

Traffic dynamics in scale-free networks with limited packet-delivering capacity

We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is proportional to $k_{i}^ϕ$, where $k_{i}$ is the degree of node $i$ and $ϕ$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $ϕ$ leading to the maximal network capacity under both routing strategies. We provide some explanations for the emergence of optimal $ϕ$.

cs.NI↗
arXiv2011

Transportation dynamics on networks of mobile agents

Most existing works on transportation dynamics focus on networks of a fixed structure, but networks whose nodes are mobile have become widespread, such as cell-phone networks. We introduce a model to explore the basic physics of transportation on mobile networks. Of particular interest are the dependence of the throughput on the speed of agent movement and communication range. Our computations reveal a hierarchical dependence for the former while, for the latter, we find an algebraic power law between the throughput and the communication range with an exponent determined by the speed. We develop a physical theory based on the Fokker-Planck equation to explain these phenomena. Our findings provide insights into complex transportation dynamics arising commonly in natural and engineering systems.

physics.soc-ph↗
arXiv2011

Predicting catastrophes in nonlinear dynamical systems by compressive sensing

An extremely challenging problem of significant interest is to predict catastrophes in advance of their occurrences. We present a general approach to predicting catastrophes in nonlinear dynamical systems under the assumption that the system equations are completely unknown and only time series reflecting the evolution of the dynamical variables of the system are available. Our idea is to expand the vector field or map of the underlying system into a suitable function series and then to use the compressive-sensing technique to accurately estimate the various terms in the expansion. Examples using paradigmatic chaotic systems are provided to demonstrate our idea.

physics.data-an↗
arXiv2011

Impact of link deletions on public cooperation in scale-free networks

Working together in groups may be beneficial if compared to isolated efforts. Yet this is true only if all group members contribute to the success. If not, group efforts may act detrimentally on the fitness of their members. Here we study the evolution of cooperation in public goods games on scale-free networks that are subject to deletion of links that are connected to the highest-degree individuals, i.e., on networks that are under attack. We focus on the case where all groups a player belongs to are considered for the determination of payoffs; the so-called multi-group public goods games. We find that the effect of link deletions on the evolution of cooperation is predominantly detrimental, although there exist regions of the multiplication factor where the existence of an "optimal" number of removed links for deterioration of cooperation can also be demonstrated. The findings are explained by means of wealth distributions and analytical approximations, confirming that socially diverse states are crucial for the successful evolution of cooperation.

physics.soc-ph↗
arXiv2010

Self-organized Emergence of Navigability on Small-World Networks

This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constructed. Navigation based on distances between vertices in the hidden metric space can efficiently deliver messages on small-world networks, in which long range connections play an important role. Numerical simulations further suggest that high cluster coefficient and low diameter are both necessary for navigability. These interesting results provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.

cs.SI↗
arXiv2010

Universal role of migration in the evolution of cooperation

We study the role of unbiased migration in cooperation in the framework of spatial evolutionary game on a variety of spatial structures, involving regular lattice, continuous plane and complex networks. A striking finding is that migration plays a universal role in cooperation, regardless of the spatial structures. For high degree of migration, cooperators cannot survive due to the failure of forming cooperator clusters to resist attacks of defectors. While for low degree of migration, cooperation is considerably enhanced compared to statically spatial game, which is due to the strengthening of the boundary of cooperator clusters by the occasionally accumulation of cooperators along the boundary. The cooperator cluster thus becomes more robust than that in static game and defectors nearby the boundary can be assimilated by cooperators, so the cooperator cluster expands, which facilitates cooperation. The general role of migration will be substantiated by sufficient simulations associated with heuristic explanations.

physics.soc-ph↗
arXiv2010

Noise bridges dynamical correlation and topology in coupled oscillator networks

We study the relationship between dynamical properties and interaction patterns in complex oscillator networks in the presence of noise. A striking finding is that noise leads to a general, one-to-one correspondence between the dynamical correlation and the connections among oscillators for a variety of node dynamics and network structures. The universal finding enables an accurate prediction of the full network topology based solely on measuring the dynamical correlation. The power of the method for network inference is demonstrated by the high success rate in identifying links for distinct dynamics on both model and real-life networks. The method can have potential applications in various fields due to its generality, high accuracy and efficiency.

physics.data-an↗
arXiv2009

Optimal View Angle in Collective Dynamics of Self-propelled Agents

We study a system of self-propelled agents in which each agent has a part of omnidirectional or panoramic view of its sensor disc, the field of vision of the agent in this case is only a sector of a disc bounded by two radii and the included arc. The inclination of these two radii is characterized as the view angle. Contrary to our intuition, we find that, the non-omnidirectional-view for swarm agents with periodic boundary conditions in noiseless Vicsek model can accelerate the transient process of the emergence of the ordered state. One consequent implication is that, there are generally superfluous communications in the Vicsek Model, which may even obstruct the possible fast swarm emergence. This phenomenon may invoke further efforts and attentions to explore the underlying mechanism of the emergence in self-propelled agents.

nlin.AO↗
arXiv2007

Congestion diffusion and decongestion strategy in networked traffic

We study the information traffic in Barabási-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order phase transition i.e., from a free flow state to full congestion sate, with the increasing of the packet generation rate. We also incorporate random effect (namely random selection of a neighbor to deliver packets) as well as a control method (namely the packet-dropping strategy of the congested nodes after some delay time $T$) into the routing protocol to test the traffic capacity of the heterogeneous networks. It is shown that there exists optimal value of $T$ for the networks to achieve the best handling ability, and the presence of appropriate random effect also attributes to the performance of the networks.

physics.soc-ph↗
arXiv2007

Urban traffic from the perspective of dual graph

In this paper, urban traffic is modeled using dual graph representation of urban transportation network where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of vehicles on the network and the motion of vehicles along roads. The road's capacity and the vehicle-turning ability at intersections are naturally incorporated in the model. The overall capacity of the system can be quantified by a phase transition from free flow to congestion. Simulation results show that the system's capacity depends greatly on the topology of transportation networks. In general, a well-planned grid can hold more vehicles and its overall capacity is much larger than that of a growing scale-free network.

physics.soc-ph↗
arXiv2007

Randomness enhances cooperation: a resonance type phenomenon in evolutionary games

We investigate the effect of randomness in both relationships and decisions on the evolution of cooperation. Simulation results show, in such randomness' presence, the system evolves to a more frequency cooperation state than in its absence. Specifically, there is an optimal amount of randomness, which can induce the highest level of cooperation. The mechanism of randomness promoting cooperation resembles a coherence-resonance-like fashion, which could be of particular interest in evolutionary game dynamics in economic, biological and social systems.

cond-mat.other↗
arXiv2007

Phase transition and hysteresis in scale-free network traffic

We model information traffic on scale-free networks by introducing the node queue length L proportional to the node degree and its delivering ability C proportional to L. The simulation gives the overall capacity of the traffic system, which is quantified by a phase transition from free flow to congestion. It is found that the maximal capacity of the system results from the case of the local routing coefficient ϕslightly larger than zero, and we provide an analysis for the optimal value of ϕ. In addition, we report for the first time the fundamental diagram of flow against density, in which hysteresis is found, and thus we can classify the traffic flow with four states: free flow, saturated flow, bistable, and jammed.

physics.data-an↗
arXiv2007

Traffic dynamics of packets generated with non-homogeneously selected sources and destinations in scale-free networks

In this paper, we study traffic dynamics in scale-free networks in which packets are generated with non-homogeneously selected sources and destinations, and forwarded based on the local routing strategy. We consider two situations of packet generation: (i) packets are more likely generated at high-degree nodes; (ii) packets are more likely generated at low-degree nodes. Similarly, we consider two situations of packet destination: (a) packets are more likely to go to high-degree nodes; (b) packets are more likely to go to low-degree nodes. Our simulations show that the network capacity and the optimal value of $α$ corresponding to the maximum network capacity greatly depend on the configuration of packets' sources and destinations. In particular, the capacity is greatly enhanced when most packets travel from low-degree nodes to high-degree nodes.

physics.soc-ph↗
arXiv2007

Collective synchronization induced by epidemic dynamics on complex networks with communities

Much recent empirical evidence shows that \textit{community structure} is ubiquitous in the real-world networks. In this Letter, we propose a growth model to create scale-free networks with the tunable strength (noted by $Q$) of community structure and investigate the influence of community strength upon the collective synchronization induced by SIRS epidemiological process. Global and local synchronizability of the system is studied by means of an order parameter and the relevant finite-size scaling analysis is provided. The numerical results show that, a phase transition occurs at $Q_c\simeq0.835$ from global synchronization to desynchronization and the local synchronization is weakened in a range of intermediately large $Q$. Moreover, we study the impact of mean degree $ $ upon synchronization on scale-free networks.

physics.data-an↗
arXiv2006

The effect of bandwidth in scale-free network traffic

We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic dynamic in real network systems. Such ability can be measured by a phase transition from free flow to congestion. Two cases of node capacity C are considered, i.e., C=constant and C is proportional to the node's degree. We figured out the decrease of the handling ability of the system together with the movement of the optimal local routing coefficient $α_c$, induced by the restriction of bandwidth. Interestingly, for low bandwidth, the same optimal value of $α_c$ emerges for both cases of node capacity. We investigate the number of packets of each node in the free flow state and provide analytical explanations for the optimal value of $α_c$. Average packets traveling time is also studied. Our study may be useful for evaluating the overall efficiency of networked traffic systems, and for allevating traffic jam in such systems.

physics.soc-ph↗
arXiv2006

Memory-Based Snowdrift Game on Networks

We present a memory-based snowdrift game (MBSG) taking place on networks. We found that, when a lattice is taken to be the underlying structure, the transition of spatial patterns at some critical values of the payoff parameter is observable for both 4 and 8-neighbor lattices. The transition points as well as the styles of spatial patterns can be explained by local stability analysis. In sharp contrast to previously reported results, cooperation is promoted by the spatial structure in the MBSG. Interestingly, we found that the frequency of cooperation of the MBSG on a scale-free network peaks at a specific value of the payoff parameter. This phenomenon indicates that properly encouraging selfish behaviors can optimally enhance the cooperation. The memory effects of individuals are discussed in detail and some non-monotonous phenomena are observed on both lattices and scale-free networks. Our work may shed some new light on the study of evolutionary games over networks.

physics.soc-ph↗