Search

Percolation, describing critical behaviors of phase transition in a geometrical context, prompts wide investigations in natural and social networks as a fundamental model. The introduction of quantum-intrinsic interference and tunneling brings percolation into quantum regime with more fascinating phenomena and unique features, which, however, hasn't been experimentally explored yet. Here we present an experimental demonstration of quantum transport in hexagonal percolation lattices by successfully mapping such large-scale porous structures into a photonic chip using femtosecond laser direct writing techniques. A quantum percolation threshold of 80% is observed in the prototyped laser-written lattices with up to 1,600 waveguides, which is significantly larger than the classical counterpart of 63%. We also investigate the spatial confinement by localization parameters and exhibit the transition from ballistic to diffusive propagation with the decrease of the occupation probability. Direct observation of quantum percolation may deepen the understanding of the relation among materials, quantum transport, geometric quenching, disorder and localization, and inspire applications for quantum technologies., 21 pages, 5 figures, 1 table, comments welcome

Complex adaptive learning is intelligent and crucial in living and inanimate complex systems. A complex system comprises many interacting individuals or units, shows hidden patterns as they interact, and widely occurs in almost every traditional discipline, from natural to social sciences. A recent study has demonstrated a so-called architected material capable of learning. It stimulates scientists to explore the mechanism of complex systems formulation. However, it is very challenging. Here the authors attempt to extract a universal rule or a law of complex adaptive learning subject to local dynamic equilibrium in complex systems from a trading volume-price probability wave equation and apply it to complex quantum systems as its application. It proves particles capable of intelligence-like properties in interactive coherence if the momentum force exerted on the complex quantum systems is non-localized. It is the cumulative probability of the moving particles observed in a time interval. Thus, it assumes that particles in complex quantum systems have a complex adaptive learning- or intelligence-like property in a reinforced coordinate, governed by the exact complex adaptive learning mechanism as that of traders in the complexity of the financial markets. With this assumption, the authors propose an innovative interpretation of entanglement in quantum mechanics. It concludes that quantum entanglement is not a state of the superposition of coherent states as the mainstream Copenhagen school of thought maintains. It is a coherent state in the interaction between two opposite, complementary, and variable forces. The authors look forward to the experimental results to examine its validity and further improve the theory until it is perfect, suggesting industrial production of entanglement resources in new technical routes available, 22 pages in total (double spaces and including a title page and a popular summary), 2 figures, and 20 references

Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in application because of limited transmission distance caused by channel loss. Here we report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel. With spatial multiplexing nature and adaptive operation, our protocol can break key rate bounds on quantum communication over quantum network without quantum memory. Compared with previous work, our protocol shows superiority in key rate and transmission distance within the state-of-the-art technology. Furthermore, we analyse the security of our protocol in the composable framework and evaluate its performance in the finite-size regime to show practicality. Based on our results, we anticipate that our protocol will play an indispensable role in constructing multipartite quantum network., 9 pages, 4 figures, 1 table

A Langevin equation is proposed to describe the transport of overdamped Brownian particles in a periodic rough potential and driven by an unbiased periodic force. The equation can be transformed into the Fokker-Planck equation by using the Kramers-Moyal expansions. The time-dependent solution of Fokker-Planck equation demonstrates different modes of the probability flow. These modes include creeping in a single direction, direction reversal and oscillating in both directions in the coordinate space. By varying the roughness and noise intensity, the flow can transform between the modes. The correlation between the noise and space indicates that the noise can maintain the oscillation of the modes and prolong the transient time to the steady state at which the flow tends to be zero.

Quantum network applications such as distributed quantum computing and quantum secret sharing represent a promising future network equipped with quantum resources. Entanglement generation and distribution over long distances are critical and unavoidable when utilizing quantum technology in a fully connected network. The distribution of bipartite entanglement over long distances has seen some progress, while the distribution of multipartite entanglement over long distances remains unsolved. Here we report a two-dimensional quantum repeater protocol for the generation of multipartite entanglement over long distances with an all-photonic framework to fill this gap. The entanglement generation yield remains proportional to the transmission efficiency regardless of the number of network users and shows long transmission distance under various numbers of network users. With the improved efficiency and flexibility of extending the number of users, we anticipate that our protocol can work as a significant building block for quantum networks in the future.

Currently most progresses on quantum secret sharing suffer from rate-distance bound, and thus the key rates are limited. In addition to the limited key rate, the technical difficulty and the corresponding cost together prevent large-scale deployment. Furthermore, the performance of most existing protocols is analyzed in the asymptotic regime without considering participant attacks. Here we report a measurement-device-independent quantum secret sharing protocol with improved key rate and transmission distance. Based on spatial multiplexing, our protocol shows it can break rate-distance bounds over network under at least ten communication parties. Compared with other protocols, our work improves the secret key rate by more than two orders of magnitude and has a longer transmission distance. We analyze the security of our protocol in the composable framework considering participant attacks and evaluate its performance in the finite-size regime. In addition, we investigate applying our protocol to digital signatures where the signature rate is improved more than $10^7$ times compared with existing protocols. We anticipate that our quantum secret sharing protocol will provide a solid future for multiparty applications on the quantum network., arXiv admin note: text overlap with arXiv:2212.05226

Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity, and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring the integrity, authenticity, and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a protocol of high-efficiency quantum digital signatures using secret sharing, one-time universal$_2$ hashing, and the one-time pad. We just need to use a 384-bit key to sign documents of up to $2^{64}$ lengths with a security bound of $10^{-19}$. If one-megabit document is signed, the signature efficiency is improved by more than $10^8$ times compared with previous quantum digital signature protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing, and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives., Comment: 19 pages, 7 figures, 4 tables. Quantum digital signatures and quantum private communication maintain a consistent level of practicality

Coherent-one-way quantum key distribution (COW-QKD), which requires a simple experimental setup and has the ability to withstand photon-number-splitting attacks, has been not only experimentally implemented but also commercially applied. However, recent studies have shown that the current COW-QKD system is insecure and can only distribute secret keys safely within 20 km of the optical fiber length. In this study, we propose a practical implementation of COW-QKD by adding a two-pulse vacuum state as a new decoy sequence. This proposal maintains the original experimental setup as well as the simplicity of its implementation. Utilizing detailed observations on the monitoring line to provide an analytical upper bound on the phase error rate, we provide a high-performance COW-QKD asymptotically secure against coherent attacks. This ensures the availability of COW-QKD within 100 km and establishes theoretical foundations for further applications., 8 pages, 5 figures, 1 table, Typos corrected

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means that the system to tolerate $f$ malicious players requires at least $3f+1$ players. The other is the security loopholes from its classical cryptography methods. Here, we propose a strict quantum Byzantine agreement with unconditional security to break this bound with nearly $1/2$ fault tolerance due to multiparty correlation provided by quantum digital signatures. Our work strictly obeys the original Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. We experimentally demonstrate three-party and five-party quantum consensus for a digital ledger. Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks., Comment: 22 pages, 10 figures. All comments are welcome!

Community detection is a significant and challenging task in network science. Nowadays, plenty of attention has been paid on local methods for community detection. Greedy expanding is a popular and efficient class of local algorithms, which typically starts from some selected central nodes and expands those nodes to obtain provisional communities by optimizing a certain quality function. In this paper, we propose a novel index, called local superiority index (LSI), to identify central nodes. In the process of expansion, we apply the fitness function to estimate the quality of provisional communities and ensure that all provisional communities must be weak communities. Evaluation based on the normalized mutual information suggests: (1) LSI is superior to the global maximal degree index and the local maximal degree index on most considered networks; (2) The greedy algorithm based on LSI is better than the classical fast algorithm on most considered networks.

Discrete-modulated continuous-variable quantum key distribution with homodyne detection is widely recognized for its ease of implementation, efficiency with respect to error correction, and its compatibility with modern optical communication devices. However, recent studies report that the application of homodyne detection obtains poor tolerance to excess noise and insufficient transmission distance, hence seriously restricting the large-scale deployment of quantum secure communication networks. In this paper, we propose a homodyne detection protocol using the quadrature phase shift keying technique. By limiting information leakage, our proposed protocol enhances excess noise tolerance to a high level. Furthermore, we demonstrate that homodyne detection performs better than heterodyne detection in quaternary-modulated continuous-variable quantum key distribution under the untrusted detector noise scenario. The security is analyzed using the tight numerical method against collective attacks in the asymptotic regime. Our results imply that the current protocol is able to distribute keys in nearly intercity area and thus paves the way for constructing low-cost quantum secure communication networks., 14 pages, 10 figures. Accepted by PRX Quantum

Twin-field quantum key distribution (TFQKD), using single-photon-type interference, offers a way to exceed the rate-distance limit without quantum repeaters. However, it still suffers from the photon losses and dark counts, which impose an ultimate limit on its transmission distance. In this letter, we propose a scheme to implement TFQKD with an entangled coherent state source in the middle to increase its range, as well as comparing its performance under coherent attacks with that of TFQKD variants. Simulations show that our protocol has a theoretical distance advantage of 400 kilometers. Moreover, the scheme has great robustness against the misalignment error and finite-size effects. Our work is a promising step toward long-distance secure communication and is greatly compatible with future global quantum network., 4+4 pages, 5 figures

Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks., Comment: 9 pages, 6 figures

As an essential application of quantum mechanics in classical cryptography, quantum secret sharing has become an indispensable component of quantum internet. Recently, a differential phase shift quantum secret sharing protocol using a twin field has been proposed to break the linear rate-distance boundary. However, this original protocol has a poor performance over channels with asymmetric transmittances. To make it more practical, we present a differential phase shift quantum secret sharing protocol with asymmetric source intensities and give the security proof of our protocol against individual attacks. Taking finite-key effects into account, our asymmetric protocol can theoretically obtain the key rate two orders of magnitude higher than that of the original protocol when the difference in length between Alice's channel and Bob's is fixed at 14 km. Moreover, our protocol can provide a high key rate even when the difference is quite large and has great robustness against finite-key effects. Therefore, our work is meaningful for the real-life applications of quantum secret sharing., 6 pages, 4 figures

Device-independent quantum key distribution (DIQKD) exploits the violation of a Bell inequality to extract secure key even if the users' devices are untrusted. Currently, all DIQKD protocols suffer from the secret key capacity bound, i.e., the secret key rate scales linearly with the transmittance of two users. Here we propose a heralded DIQKD scheme based on entangled coherent states to improve entangling rates whereby long-distance entanglement is created by single-photon-type interference. The secret key rate of our scheme can significantly outperform the traditional two-photon-type Bell-state measurement scheme and, importantly, surpass the above capacity bound. Our protocol therefore is an important step towards a realization of DIQKD and can be a promising candidate scheme for entanglement swapping in future quantum internet., Comment: 5 pages, 3 figures

It is a longstanding debate on the absence of threshold for susceptible-infected-susceptible (SIS) model on networks with finite second order moment of degree distribution. The eigenvector localization of the adjacency matrix for a network gives rise to the inactive Griffiths phase featuring slow decay of the activity localized around highly connected nodes due to the dynamical fluctuation. We show how it dramatically changes our understanding of the SIS model, opening up new possibilities for the debate. We derive the critical condition for Griffiths to active phase transition: on average, an infected node can further infect another one in the characteristic lifespan of the star subgraph composed of the node and its nearest neighbors. The system approaches the critical point of avoiding the irreversible dynamical fluctuation and the trap of absorbing state. As a signature of the phase transition, the infection density of a node is not only proportional to its degree, but also proportional to the exponentially growing lifespan of the star. And the divergence of the average lifespan of the stars is responsible for the vanishing threshold in the thermodynamic limit. The eigenvector localization exponentially reinforces the infection of highly connected nodes, while it inversely suppresses the infection of small-degree nodes.

In some systems, the connecting probability (and thus the percolation process) between two sites depends on the geometric distance between them. To understand such process, we propose gravitationally correlated percolation models for link-adding networks on the two-dimensional lattice $G$ with two strategies $S_{\rm max}$ and $S_{\rm min}$, to add a link $l_{i,j}$ to connect site $i$ and site $j$ with mass $m_i$ and $m_j$, respectively; $m_i$ and $m_j$ are sizes of the clusters which contain site $i$ and site $j$, respectively. The probability to add the link $l_{i,j}$ is related to the generalized gravity $g_{ij} \equiv m_i m_j/r_{ij}^d$, where $r_{ij}$ is the geometric distance between $i$ and $j$, and $d$ is an adjustable decaying exponent. In the beginning of the simulation, all sites of $G$ are occupied and there is no link. In the simulation process, two inter-cluster links $l_{i,j}$ and $l_{k,n}$ are randomly chosen and the generalized gravities $g_{ij}$ and $g_{kn}$ are computed. In the strategy $S_{\rm max}$, the link with larger generalized gravity is added. In the strategy $S_{\rm min}$, the link with smaller generalized gravity is added, which include percolation on the Erd\H os-R\'enyi random graph and the Achlioptas process of explosive percolation as the limiting cases, $d \to \infty$ and $d \to 0$, respectively. Adjustable strategies facilitate or inhibit the network percolation in a generic view. We calculate percolation thresholds $T_c$ and critical exponents $\beta$ by numerical simulations. We also obtain various finite-size scaling functions for the node fractions in percolating clusters or arrival of saturation length with different intervening strategies., Comment: 26 pages, 8 figures, Chinese Journal of Physics, accepted for publication

In this paper, we study the control of the traffic-driven epidemic spreading by immunization strategy. We consider the random, degree-based and betweeness-based immunization strategies, respectively. It is found that the betweeness-based immunization strategy can most effectively prevent the outbreak of traffic-driven epidemic. Besides, we find that the critical number of immune nodes above which epidemic dies out is increased with the enhancement of the spreading rate and the packet-generation rate., Comment: 5 pages, 6 figures. arXiv admin note: text overlap with arXiv:1802.01246, arXiv:1802.01258

We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent $\gamma$ of power-law degree distribution. It is found that the epidemic threshold is minimized at about $\gamma=2.2$. Moreover, we find that nodes with larger algorithmic betweenness are more likely to be infected. We expect our work to provide new insights into the effect of network structures on traffic-driven epidemic spreading., Comment: 8 pages, 5 figures. arXiv admin note: text overlap with arXiv:1503.00145, arXiv:1503.00149

The scattering of a positron by a muon in the presence of a linearly polarized laser field is investigated in the first Born approximation. The theoretical results reveal: (1) At large scattering angle, an amount of multiphoton processes take place in the course of scattering. The photon emission processes predominate the photon absorption ones. (2) Some nonlinear phenomena about oscillations, dark angular windows, and asymmetry can be observed in angular distributions. We analyze the cause giving rise to dark windows and geometric asymmetry initially noted in the potential scattering. (3) We also analyze the total differential cross-section, the result shows that the larger the incident energy is, the smaller the total differential cross-section is. The reasons of these new results are analyzed.

An extended social force model with a dynamic navigation field is proposed to study bidirectional pedestrian movement. The dynamic navigation field is introduced to describe the desired direction of pedestrian motion resulting from the decision-making processes of pedestrians. The macroscopic fundamental diagrams obtained using the extended model are validated against camera-based observations. Numerical results show that this extended model can reproduce collective phenomena in pedestrian traffic, such as dynamic multilane flow and stable separate-lane flow. Pedestrians’ path choice behavior significantly affects the probability of congestion and the number of self-organized lanes.

The intersecting pedestrian flow on the 2D lattice with random update rule is studied. Each pedestrian has three moving directions without the back step. Under periodic boundary conditions, an intermediate phase has been found at which some pedestrians could move along the border of jamming stripes. We have performed mean field analysis for the moving and intermediate phase respectively. The analytical results agree with the simulation results well. The empty site moves along the interface of jamming stripes when the system only has one empty site. The average movement of empty site in one Monte Carlo step (MCS) has been analyzed through the master equation. Under open boundary conditions, the system exhibits moving and jamming phases. The critical injection probability $\alpha_c$ shows nontrivially against the forward moving probability $q$. The analytical results of average velocity, the density and the flow rate against the injection probability in the moving phase also agree with simulation results well., Comment: 11 pages, 15 figures

We ascertain the modularity-like objective function whose optimization is equivalent to the maximum likelihood in annotated networks. We demonstrate that the modularity-like objective function is a linear combination of modularity and conditional entropy. In contrast with statistical inference methods, in our method, the influence of the metadata is adjustable; when its influence is strong enough, the metadata can be recovered. Conversely, when it is weak, the detection may correspond to another partition. Between the two, there is a transition. This paper provides a concept for expanding the scope of modularity methods.

The communication networks in real world often couple with each other to save costs, which results in any network does not have a stand-alone function and efficiency. To investigate this, in this paper we propose a transportation model on two coupled networks with bandwidth sharing. We find that the free-flow state and the congestion state can coexist in the two coupled networks, and the free-flow path and congestion path can coexist in each network. Considering three bandwidth-sharing mechanisms, random, assortative and disassortative couplings, we also find that the transportation capacity of the network only depends on the coupling mechanism, and the fraction of coupled links only affects the performance of the system in the congestion state, such as the traveling time. In addition, with assortative coupling, the transportation capacity of the system will decrease significantly. However, the disassortative coupling has little influence on the transportation capacity of the system, which provides a good strategy to save bandwidth. Furthermore, a theoretical method is developed to obtain the bandwidth usage of each link, based on which we can obtain the congestion transition point exactly., 9 pages, 5 figures

In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths could be different between different nodes. We find that the heterogeneous dependency strength will make the system more robust, and for various distributions of dependency strengths both continuous and discontinuous percolation transitions can be found. For Erd\H{o}s-R\'{e}nyi networks, we prove that the crossing point of the continuous and discontinuous percolation transitions is dependent on the first five moments of the dependency strength distribution. This indicates that the discontinuous percolation transition on networks with dependency is determined not only by the dependency strength but also by its distribution. Furthermore, in the area of the continuous percolation transition, we also find that the critical point depends on the first and second moments of the dependency strength distribution. To validate the theoretical analysis, cases with two different dependency strengths and Gaussian distribution of dependency strengths are presented as examples., Comment: 8 pages, 8 figures

We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We find that when most of dependency links are inner- or inter-ones, the coupled networks system is fragile and makes a discontinuous percolation transition. However, when the numbers of two types of dependency links are close to each other, the system is robust and makes a continuous percolation transition. This indicates that the high density of dependency links could not always lead to a discontinuous percolation transition as the previous studies. More interestingly, although the robustness of the system can be optimized by adjusting the ratio of the two types of dependency links, there exists a critical average degree of the networks for coupled random networks, below which the crossover of the two types of percolation transitions disappears, and the system will always demonstrate a discontinuous percolation transition. We also develop an approach to analyze this model, which is agreement with the simulation results well., 9 pages, 4 figures

Comparing with single networks, the multiplex networks bring two main effects on the spreading process among individuals. First, the pathogen or information can be transmitted to more individuals through different layers at one time, which enlarges the spreading scope. Second, through different layers, an individual can also transmit the pathogen or information to the same individuals more than once at one time, which makes the spreading more effective. To understand the different roles of the spreading scope and effectiveness, we propose an epidemic model on multiplex networks with link overlapping, where the spreading effectiveness of each interaction as well as the variety of channels (spreading scope) can be controlled by the number of overlapping links. We find that for Poisson degree distribution, increasing the epidemic scope (the first effect) is more efficient than enhancing epidemic probability (the second effect) to facilitate the spreading process. However, for power-law degree distribution, the effects of the two factors on the spreading dynamics become complicated. Enhancing epidemic probability makes pathogen or rumor easier to outbreak in a finite system. But after that increasing epidemic scopes is still more effective for a wide spreading. Theoretical results along with reasonable explanation for these phenomena are all given in this paper, which indicates that the epidemic scope could play an important role in the spreading dynamics., 12 pages, 5 figures

We first study the influence of an efficient feedback strategy named prediction feedback strategy (PFS) based on a multi-route scenario in which dynamic information can be generated and displayed on the board to guide road users to make a choice. In this scenario, our model incorporates the effects of adaptability into the cellular automaton models of traffic flow. Simulation results adopting this optimal information feedback strategy have demonstrated high efficiency in controlling spatial distribution of traffic patterns compared with the other three information feedback strategies, i.e., vehicle number and flux. At the end of this paper, we also discuss in what situation PFS will become invalid in multi-route systems., 15 pages, 15 figures, Physica A (2010), doi:10.1016/j.physa.2010.02.036

We propose a novel capacity model for complex networks against cascading failure. In this model, vertices with both higher loads and larger degrees should be paid more extra capacities, i.e. the allocation of extra capacity on vertex $i$ will be proportional to $ k_{i}^{\gamma} $, where $ k_{i}$ is the degree of vertex $i$ and $\gamma>0$ is a free parameter. We have applied this model on Barab\'asi-Albert network as well as two real transportation networks, and found that under the same amount of available resource, this model can achieve better network robustness than previous models., Comment: 4 pages, 4 figures

As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two $k$-cliques means that they share at least $l1$ makes a step-function-like discontinuous phase transition in the thermodynamic limit and a continuous phase transition for $l=1$. More interesting, our analysis shows that at the critical point, the order parameter $\phi_c$ for $l>1$ is neither $0$ nor $1$, but a constant depending on $k$ and $l$. All these theoretical findings are in agreement with the simulation results, which give theoretical support and clarification for previous simulation studies of clique percolation., Comment: 6 pages, 5 figures

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., 9 pages, 6 figures

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gravity centrality index to identify the influential spreaders in complex networks. The comparison between the gravity centrality index and some well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, and k-shell centrality, and so forth, indicates that our method can effectively identify the influential spreaders in real networks as well as synthetic networks. We also use the classical Susceptible-Infected-Recovered (SIR) epidemic model to verify the good performance of our method., Comment: 4 tables and 4 figures, accepted by Physica A

We investigate the accumulated wealth distribution by adopting evolutionary games taking place on scale-free networks. The system self-organizes to a critical Pareto distribution (1897) of wealth $P(m)\sim m^{-(v+1)}$ with $1.6 < v, 5 pages, 8 figures

Recently, motivated by the pioneer works that reveal the small-world effect and scale-free property of various real-life networks, many scientists devote themselves into studying complex networks. One of the ultimate goals is to understand how the topological structures of networks affect the dynamics upon them. In this paper, we give a brief review on the studies of epidemic dynamics on complex networks, including the description of classical epidemic models, the epidemic spread on small-world and scale-free networks, and network immunization. Finally, a prospect is addressed and some interesting problems are listed., Comment: 12 pages, no eps figures, a breif review

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.

In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a power-law form. Numerical study exhibits that the nodes with larger strength is preferential to be infected, but the hierarchical dynamics are not clearly found, which is different from the well-known result in unweighed network case. In addition, also by numerical study, we demonstrate that larger dispersion of weight of networks results in slower spreading, which indicates that epidemic spreads more quickly on unweighted scale-free networks than on weighted scale-free networks with the same condition., 4 pages, 5 figures. Chin. Phys. Lett in Press 2005

An artificial stock market is established with the modeling method and ideas of cellular automata. Cells are used to represent stockholders, who have the capability of self-teaching and are affected by the investing history of the neighboring ones. The neighborhood relationship among the stockholders is the expanded Von Neumann relationship, and the interaction among them is realized through selection operator and crossover operator. Experiment shows that the large events are frequent in the fluctuations of the stock price generated by the artificial stock market when compared with a normal process and the price returns distribution is a Levy distribution in the central part followed by an approximately exponential truncation., 5 pages, 4 figures, to be published in

Based on the adiabatic theory for the evolutionary minority game (EMG) that we proposed earlier[1], we perform a detail analysis of the EMG limited to three groups of agents. We derive a formula for the critical point of the transition from segregation (into opposing groups) to clustering (towards cautious behaviors). Particular to the three-group EMG, the strategy switching in the "extreme" group does not occur at every losing step and is strongly intermittent. This leads to an correction to the critical value of the number of agents at the transition, $N_c$. Our expression for $N_c$ is in agreement with the results obtained from our numerical simulations., 4 pages and 2 figures

It is known that the stationary distribution of the random walk process is dependent on the structure of the network. This could provide us a solution of the network reconstruction. However, the stationary distribution of the random walk process can only reflect the relative size of node degrees directly, how to infer the real connection is still a problem. In this paper, we will propose a method to reconstruct network by the random walk process, which can reconstruct the total number of links, degree sequence and links sequentially. In our method, only the stationary distribution is used, and no data of the evolution process is needed, such as the first passage time. We perform our method on some network models and real-world network, the results indicate our method can reconstruct networks accurately, even when we can not get the exact stationary distribution., 5 pages, 5 figures

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., Comment: 6 pages, 4 figures

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., 8 pages, 4 figures

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., Comment: 17 pages, 7 figures

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., 17 pages, 5 figures

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., this work was finished in (Dated: April 22, 2011)

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., 4 figures, 5 pages

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., Comment: 10 pages, 9 figures

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 betweenness. 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.

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.

Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the two-dimensional(2D) plane. By overlapping it with Achlioptas process, it serves as a gravity model which can be tuned to facilitate or inhibit the network percolation in a generic view, cover a broad range of thresholds. Moreover, it yields a set of new scaling relations. In the present work, we develop an approach to determine critical points for them by simulating the temporal evolutions of type-I, type-II and type-III links(chosen from both inter-cluster links, an intra-cluster link compared with an inter-cluster one, and both intra-cluster ones, respectively) and corresponding average lengths. Numerical results have revealed objective competition between fractions, average lengths of three types of links, verified the balance happened at critical points. The variation of decay exponents $a$ or transmission radius $R$ always shifts the temporal pace of the evolution, while the steady average lengths and the fractions of links always keep unchanged just as the values in Achlioptas process. Strategy with maximum gravity can keep steady average length, while that with minimum one can surpass it. Without the confinement of transmission range, $\bar{l} \to \infty$ in thermodynamic limit, while $\bar{l}$ does not when with it. However, both mechanisms support critical points. In two-dimensional free space, the relevance of correlated percolation in link-adding process is verified by validation of new scaling relations with various exponent $a$, which violates the scaling law of Weinrib's.

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., 7 pages, 4 figures. Accepted by Scientific Reports