Searcharxiv⌕ Search

arXiv subjects

Bing-Hong Wang

Publications and source records attributed to Bing-Hong Wang.

At least 37 records · Page 2Linked to original sources

Disassortative mixing accelerates consensus in the naming game

In this paper, we study the role of degree mixing in the naming game. It is found that consensus can be accelerated on disassortative networks. We provide a qualitative explanation of this phenomenon based on clusters statistics. Compared with assortative mixing, disassortative mixing can promote the merging of different clusters, thus resulting in a shorter convergence time. Other quantities, including the evolutions of the success rate, the number of total words and the number of different words, are also studied.

physics.soc-ph↗

Suppressing traffic-driven epidemic spreading by edge-removal strategies

The interplay between traffic dynamics and epidemic spreading on complex networks has received increasing attention in recent years. However, the control of traffic-driven epidemic spreading remains to be a challenging problem. In this Brief Report, we propose a method to suppress traffic-driven epidemic outbreak by properly removing some edges in a network. We find that the epidemic threshold can be enhanced by the targeted cutting of links among large-degree nodes or edges with the largest algorithmic betweeness. In contrast, the epidemic threshold will be reduced by the random edge removal. These findings are robust with respect to traffic-flow conditions, network structures and routing strategies. Moreover, we find that the shutdown of targeted edges can effectively release traffic load passing through large-degree nodes, rendering a relatively low probability of infection to these nodes.

physics.soc-ph↗

Bidirectional selection between two classes in complex social networks

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.

physics.soc-ph↗

A Model of Two-Way Selection System for Human Behavior

We propose a model of two-way selection system. It appears in the processes like choosing a mate between men and women, making contracts between job hunters and recruiters, and trading between buyers and sellers. In this paper, we propose a model of two-way selection system, and present its analytic solution for the expectation of successful matching total and the regular pattern that the matching rate trends toward an inverse proportion to either the ratio between the two sides or the ratio of the state total to the smaller people number. The proposed model is verified by empirical data of the matchmaking fairs. Results indicate that the model well predicts this typical real-world two- way selection behavior to the bounded error extent, thus it is helpful for understanding the dynamics mechanism of the real-world two-way selection system.

physics.gen-ph↗

Punctuated equilibrium dynamics in human communications

A minimal model based on individual interactions is proposed to study the non-Poisson statistical properties of human behavior: individuals in the system interact with their neighbors, the probability of an individual acting correlates to its activity, and all individuals involved in action will change their activities randomly. The model creates rich non-Poisson spatial-temporal properties in the activities of individuals, in agreement with the patterns of human communication behaviors. Our findings provide insight into various human activities, embracing a range of realistic social interacting systems, particularly, intriguing bimodal phenomenons. This model bridges priority queues and punctuated equilibrium, and our modeling and analysis is likely to shed light on non-Poisson phenomena in many complex systems.

physics.soc-ph↗

Network cluster detecting in associated bi-graph view

We find there is relationship between the associated bigraph and the cluster (or community) detecting on network. By imbedding the associated bigraph of some network (suppose it has cluster structures) into some space, we can identify the clusters on this network, which is a new method for network cluster detecting. And this method, of which the physical meaning is clear and the time complexity is acceptable, may provide us a new point to understand the structure and character of networks. In this paper, We test the methods on serval computer-generated networks and real networks. A computer-generated network with 128 vertexes and the Zachary Network, which presents the structure of a karate club, can be partitioned correctly by these methods. And the Dolphin Network, which presents the relationship between 62 dolphins on the coast of New Zealand, is partitioned reasonably.

physics.soc-ph↗

Degree-layer theory of network topology

The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Therefore, the degree is very important structural parameter of network topology. However, given the number of nodes and the degree of each node in a network, the topology of the network cannot be determined. Therefore, we propose the degree-layer theory of network topology to describe deeply the network topology. First, we propose the concept of degree-tree with the breadth-first search tree. The degrees of all nodes are layered and have a hierarchical structure. Second,the degree-layer theory is described in detail. Two new concepts are defined in the theory. An index is proposed to quantitatively distinguish the two network topologies. It also can quantitatively measure the stability of network topology built by a model mechanism. One theorem is given and proved, furthermore, and one corollary is derived directly from the theorem. Third, the applications of the degree-layer theory are discussed in the ER random network, WS small world network and BA scale-free network, and the influences of the degree distribution on the stability of network topology are studied in the three networks. In conclusion, the degree-layer theory is helpful for accurately describing the network topology, and provides a new starting point for researching the similarity and isomorphism between two network topologies.

physics.soc-ph↗

The upper bound of packet transmission capacity in local static routings

We propose a universal analysis for static routings on networks and describe the congestion characteristics by the theory. The relation between average transmission time and transmission capacity is described by inequality T0Rc0<=1. For large scale sparse networks, the non-trivial upper bond of transmission capacity Rc0 is limited by Rc0<=1/< 1/k > in some approximate conditions. the theoretical results agree with simulations on BA Networks.

cs.NI↗

Opinion Dynamic with agents immigration

We propose a strategy for achieving maximum cooperation in evolutionary games on complex networks. Each individual is assigned a weight that is proportional to the power of its degree, where the exponent alpha is an adjustable parameter that controls the level of diversity among individuals in the network. During the evolution, every individual chooses one of its neighbors as a reference with a probability proportional to the weight of the neighbor, and updates its strategy depending on their payoff difference. It is found that there exists an optimal value of alpha, for which the level of cooperation reaches maximum. This phenomenon indicates that, although high-degree individuals play a prominent role in maintaining the cooperation, too strong influences from the hubs may counterintuitively inhibit the diffusion of cooperation. We provide a physical theory, aided by numerical computations, to explain the emergence of the optimal cooperation. Other pertinent quantities such as the payoff, the cooperator density as a function of the degree, and the payoff distribution, are also investigated. Our results suggest that, in order to achieve strong cooperation on a complex network, individuals should learn more frequently from neighbors with higher degrees, but only to certain extent.

physics.soc-ph↗

Diversity of individual mobility patterns and emergence of aggregated scaling laws

Uncovering human mobility patterns is of fundamental importance to the understanding of epidemic spreading, urban transportation and other socioeconomic dynamics embodying spatiality and human travel. According to the direct travel diaries of volunteers, we show the absence of scaling properties in the displacement distribution at the individual level,while the aggregated displacement distribution follows a power law with an exponential cutoff. Given the constraint on total travelling cost, this aggregated scaling law can be analytically predicted by the mixture nature of human travel under the principle of maximum entropy. A direct corollary of such theory is that the displacement distribution of a single mode of transportation should follow an exponential law, which also gets supportive evidences in known data. We thus conclude that the travelling cost shapes the displacement distribution at the aggregated level.

physics.soc-ph↗

Cascading Walks Model for Human Mobility Patterns

Uncovering the mechanism behind the scaling law in human trajectories is of fundamental significance in understanding many spatio-temporal phenomena. In combination of the exploration and the preferential returns, we propose a simple dynamical model mainly based on the cascading processes to capture the human mobility patterns. By the numerical simulations and analytical studies, we show more than five statistical characters that are well consistent with the empirical observations, including several type of scaling anomalies, and the ultraslow diffusion property, implying the cascading processes associated with the other two mechanisms are indeed a key in the understanding of human mobility activities. Moreover, both of the diverse individual mobility and aggregated scaling move-lengths, bridging the micro and macro patterns in human mobility. Our model provides deeper understandings on the emergence of human mobility patterns.

physics.soc-ph↗

Correlations and Scaling Laws in Human Mobility

Human mobility patterns deeply affect the dynamics of many social systems. In this paper, we empirically analyze the real-world human movements based GPS records, and observe rich scaling properties in the temporal-spatial patterns as well as an abnormal transition in the speed-displacement patterns. We notice that the displacements at the population level show significant positive correlation, indicating a cascade-like nature in human movements. Furthermore, our analysis at the individual level finds that the displacement distributions of users with strong correlation of displacements are closer to power laws, implying a relationship between the positive correlation of the series of displacements and the form of an individual's displacement distribution. These findings from our empirical analysis show a factor directly relevant to the origin of the scaling properties in human mobility.

physics.soc-ph↗

Braess's Paradox in Epidemic Game: Better Condition Results in Less Payoff

Facing the threats of infectious diseases, we take various actions to protect ourselves, but few studies considered an evolving system with competing strategies. In view of that, we propose an evolutionary epidemic model coupled with human behaviors, where individuals have three strategies: vaccination, self-protection and laissez faire, and could adjust their strategies according to their neighbors' strategies and payoffs at the beginning of each new season of epidemic spreading. We found a counter-intuitive phenomenon analogous to the well-known \emph{Braess's Paradox}, namely a better condition may lead to worse performance. Specifically speaking, increasing the successful rate of self-protection does not necessarily reduce the epidemic size or improve the system payoff. This phenomenon is insensitive to the network topologies, and can be well explained by a mean-field approximation. Our study demonstrates an important fact that a better condition for individuals may yield a worse outcome for the society.

physics.soc-ph↗

Modeling for the Dynamics of Human Innovative Behaviors

How to promote the innovative activities is an important problem for modern society. In this paper, combining with the evolutionary games and information spreading, we propose a lattice model to investigate dynamics of human innovative behaviors based on benefit-driven assumption. Simulations show several properties in agreement with peoples' daily cognition on innovative behaviors, such as slow diffusion of innovative behaviors, gathering of innovative strategy on "innovative centers", and quasi-localized dynamics. Furthermore, our model also emerges rich non-Poisson properties in the temporal-spacial patterns of the innovative status, including the scaling law in the interval time of innovation releases and the bimodal distributions on the spreading range of innovations, which would be universal in human innovative behaviors. Our model provide a basic framework on the study of the issue relevant to the evolution of human innovative behaviors and the promotion measurement of innovative activities.

physics.soc-ph↗

Renormalization and small-world model of fractal quantum repeater networks

Quantum networks provide access to exchange of quantum information. The primary task of quantum networks is to distribute entanglement between remote nodes. Although quantum repeater protocol enables long distance entanglement distribution, it has been restricted to one-dimensional linear network. Here we develop a general framework that allows application of quantum repeater protocol to arbitrary quantum repeater networks with fractal structure. Entanglement distribution across such networks is mapped to renormalization. Furthermore, we demonstrate that logarithmical times of recursive such renormalization transformations can trigger fractal to small-world transition, where a scalable quantum small-world network is achieved. Our result provides new insight into quantum repeater theory towards realistic construction of large-scale quantum networks.

physics.soc-ph↗

Hierarchical structure of stock price fluctuations in financial markets

The financial market and turbulence have been broadly compared on account of the same quantitative methods and several common stylized facts they shared. In this paper, the She-Leveque (SL) hierarchy, proposed to explain the anomalous scaling exponents deviated from Kolmogorov monofractal scaling of the velocity fluctuation in fluid turbulence, is applied to study and quantify the hierarchical structure of stock price fluctuations in financial markets. We therefore observed certain interesting results: (i) The hierarchical structure related to multifractal scaling generally presents in all the stock price fluctuations we investigated. (ii) The quantitatively statistical parameters that describes SL hierarchy are different between developed financial markets and emerging ones, distinctively. (iii) For the high-frequency stock price fluctuation, the hierarchical structure varies with different time period. All these results provide a novelty analogy in turbulence and financial market dynamics and a insight to deeply understand the multifractality in financial markets.

q-fin.ST↗

The Impacts of Subsidy Policies on Vaccination Decisions in Contact Networks

Often, vaccination programs are carried out based on self-interest rather than being mandatory. Owing to the perceptions about risks associated with vaccines and the `herd immunity' effect, it may provide suboptimal vaccination coverage for the population as a whole. In this case, some subsidy policies may be offered by the government to promote vaccination coverage. But, not all subsidy policies are effective in controlling the transmission of infectious diseases. We address the question of which subsidy policy is best, and how to appropriately distribute the limited subsidies to maximize vaccine coverage. To answer these questions, we establish a model based on evolutionary game theory, where individuals try to maximize their personal payoffs when considering the voluntary vaccination mechanism. Our model shows that voluntary vaccination alone is insufficient to control an epidemic. Hence, two subsidy policies are systematically studied: (1) in the free subsidy policy the total amount of subsidies is distributed to some individuals and all the donees may vaccinate at no cost, and (2) in the part-offset subsidy policy each vaccinated person is offset by a certain proportion of the vaccination cost. Simulations suggest that, since the part-offset subsidy policy can encourage more individuals to be vaccinated, the performance of this policy is significantly better than that of the free subsidy policy.

physics.soc-ph↗

Aspiration-induced reconnection in spatial public goods game

In this Letter, we introduce an aspiration-induced reconnection mechanism into the spatial public goods game. A player will reconnect to a randomly chosen player if its payoff acquired from the group centered on the neighbor does not exceed the aspiration level. We find that an intermediate aspiration level can best promote cooperation. This optimal phenomenon can be explained by a negative feedback effect, namely, a moderate level of reconnection induced by the intermediate aspiration level induces can change the downfall of cooperators, and then facilitate the fast spreading of cooperation. While insufficient reconnection and excessive reconnection induced by low and high aspiration levels respectively are not conductive to such an effect. Moreover, we find that the intermediate aspiration level can lead to the heterogeneous distribution of degree, which will be beneficial to the evolution of cooperation.

physics.soc-ph↗