arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 415 records · Page 23Linked to original sources

arXiv2015

Unfolding large-scale online collaborative human dynamics

Large-scale interacting human activities underlie all social and economic phenomena, but quantitative understanding of regular patterns and mechanism is very challenging and still rare. Self-organized online collaborative activities with precise record of event timing provide unprecedented opportunity. Our empirical analysis of the history of millions of updates in Wikipedia shows a universal double power-law distribution of time intervals between consecutive updates of an article. We then propose a generic model to unfold collaborative human activities into three modules: (i) individual behavior characterized by Poissonian initiation of an action, (ii) human interaction captured by a cascading response to others with a power-law waiting time, and (iii) population growth due to increasing number of interacting individuals. This unfolding allows us to obtain analytical formula that is fully supported by the universal patterns in empirical data. Our modeling approaches reveal "simplicity" beyond complex interacting human activities.

physics.soc-ph↗

arXiv2015

Topography of the graphene/Ir(111) moir{é} studied by surface x-ray diffraction

The structure of a graphene monolayer on Ir(111) has been investigated {\it in situ} in the growth chamber by surface x-ray diffraction including the specular rod, which allows disentangling the effect of the sample roughness from that of the nanorippling of graphene and iridium along the moir{é}-like pattern between graphene and Ir(111). Accordingly we are able to provide precise estimates of the undulation associated with this nanorippling, which is small in this weakly interacting graphene/metal system and thus proved difficult to assess in the past. The nanoripplings of graphene and iridium are found in phase, i.e. the in-plane position of their height maxima coincide, but the amplitude of the height modulation is much larger for graphene ($0.379 \pm 0.044$ Å) than, {\it e.g.}, for the topmost Ir layer ($0.017 \pm 0.002$ Å). The average graphene-Ir distance is found to be $3.38 \pm 0.04$ Å.

cond-mat.mtrl-sci↗

arXiv2015

Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell decomposition are the most influential spreaders. However, through a great deal of numerical simulations, we observe that not in all real networks do nodes in high shells are very influential: in some networks the core nodes are the most influential which we call true core, while in others nodes in high shells, even the innermost core, are not good spreaders which we call core-like group. By analyzing the k-core structure of the networks, we find that the true core of a network links diversely to the shells of the network, while the core-like group links very locally within the group. For nodes in the core-like group, the k-shell index cannot reflect their location importance in the network. We further introduce a measure based on the link diversity of shells to effectively distinguish the true core and core-like group, and identify core-like groups throughout the networks. Our findings help to better understand the structural features of real networks and influential nodes.

physics.soc-ph↗

arXiv2015

Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics

Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness for each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes.

physics.soc-ph↗

arXiv2015

Extortion under Uncertainty: Zero-Determinant Strategies in Noisy Games

Repeated game theory has been one of the most prevailing tools for understanding the long-run relationships, which are footstones in building human society. Recent works have revealed a new set of "zero-determinant (ZD)" strategies, which is an important advance in repeated games. A ZD strategy player can exert a unilaterally control on two players' payoffs. In particular he can deterministically set the opponent's payoff, or enforce an unfair linear relationship between the players' payoffs, thereby always seizing an advantageous share of payoffs. One of the limitations of the original ZD strategy, however, is that it does not capture the notion of robustness when the game is subjected to stochastic errors. In this paper, we propose a general model of ZD strategies for noisy repeated games, and find that ZD strategies have high robustness against errors. We further derive the pinning strategy under noise, by which the ZD strategy player coercively set the opponent's expected payoff to his desired level, although his payoff control ability declines with the increase of noise strength. Due to the uncertainty caused by noise, the ZD strategy player cannot secure his payoff to be higher than the opponent's, which implies strong extortions do not exist even under low noise. While we show that the ZD strategy player can still establish a novel kind of extortions, named weak extortions, where any increase of his own payoff always exceeds that of the opponent's by a fixed percentage, and the conditions under which the weak extortions can be realized are more stringent as the noise becomes stronger.

cs.GT↗

arXiv2015

Locating influential nodes via dynamics-sensitive centrality

With great theoretical and practical significance, locating influential nodes of complex networks is a promising issues. In this paper, we propose a dynamics-sensitive (DS) centrality that integrates topological features and dynamical properties. The DS centrality can be directly applied in locating influential spreaders. According to the empirical results on four real networks for both susceptible-infected-recovered (SIR) and susceptible-infected (SI) spreading models, the DS centrality is much more accurate than degree, $k$-shell index and eigenvector centrality.

cs.SI↗

arXiv2015

Quantum discord for the general two-qubit case

Recently, Girolami and Adesso have demonstrated that the calculation of quantum discord for two-qubit case can be viewed as to solve a pair of transcendental equation (Phys. Rev. A, {\bf 83}, 052108(2011)). In present work, we introduce the generalized Choi-Jamiolkowski isomorphism and apply it as a convenient tool for constructing transcendental equations. For the general two-qubit case, we show that the transcendental equations always have a finite set of universal solutions, this result can be viewed as a generalization of the one get by Ali, Rau, and Alber (Phys. Rev. A, {\bf 81}, 042105 (2010)). For a subclass of $X$ state, we find the analytical solutions by solving the transcendental equations.

quant-ph↗

arXiv2015

Possible superconductivity in Sr$_{2}$IrO$_{4}$ probed by quasiparticle interference

Based on the possible superconducting (SC) pairing symmetries recently proposed, the quasiparticle interference (QPI) patterns in electron- and hole-doped Sr$_{2}$IrO$_{4}$ are theoretically investigated. In the electron-doped case, the QPI spectra can be explained based on a model similar to the octet model of the cuprates while in the hole-doped case, both the Fermi surface topology and the sign of the SC order parameter resemble those of the iron pnictides and there exists a QPI vector resulting from the interpocket scattering between the electron and hole pockets. In both cases, the evolution of the QPI vectors with energy and their behaviors in the nonmagnetic and magnetic impurity scattering cases can well be explained based on the evolution of the constant-energy contours and the sign structure of the SC order parameter. The QPI spectra presented in this paper can be compared with future scanning tunneling microscopy experiments to test whether there are SC phases in electron- and hole-doped Sr$_{2}$IrO$_{4}$ and what the pairing symmetry is.

cond-mat.supr-con↗

arXiv2015

Promotion and resignation in employee networks

Enterprises have put more and more emphasis on data analysis so as to obtain effective management advices. Managers and researchers are trying to dig out the major factors that lead to employees' promotion and resignation. Most previous analyses were based on questionnaire survey, which usually consists of a small fraction of samples and contains biases caused by psychological defense. In this paper, we successfully collect a data set consisting of all the employees' work-related interactions (action network, AN for short) and online social connections (social network, SN for short) of a company, which inspires us to reveal the correlations between structural features and employees' career development, namely promotion and resignation. Through statistical analysis and prediction, we show that the structural features of both AN and SN are correlated and predictive to employees' promotion and resignation, and the AN has higher correlation and predictability. More specifically, the in-degree in AN is the most relevant indicator for promotion; while the k-shell index in AN and in-degree in SN are both very predictive to resignation. Our results provide a novel and actionable understanding of enterprise management and suggest that to enhance the interplays among employees, no matter work-related or social interplays, can largely improve the loyalty of employees.

physics.soc-ph↗

arXiv2015

Promoting collective motion of self-propelled agents by distance-based influence

We propose a dynamic model for a system consisting of self-propelled agents in which the influence of an agent on another agent is weighted by geographical distance. A parameter $α$ is introduced to adjust the influence: the smaller value of $α$ means that the closer neighbors have stronger influence on the moving direction. We find that there exists an optimal value of $α$, leading to the highest degree of direction consensus. The value of optimal $α$ increases as the system size increases, while it decreases as the absolute velocity, the sensing radius and the noise amplitude increase.

physics.soc-ph↗

arXiv2015

High order numerical schemes for second-order FBSDEs with applications to stochastic optimal control

This is one of our series papers on multistep schemes for solving forward backward stochastic differential equations (FBSDEs) and related problems. Here we extend (with non-trivial updates) our multistep schemes in [W. Zhao, Y. Fu and T. Zhou, SIAM J. Sci. Comput., 36 (2014), pp. A1731-A1751.] to solve the second order FBSDEs (2FBSDEs). The key feature of the multistep schemes is that the Euler method is used to discrete the forward SDE, which dramatically reduces the entire computational complexity. Moreover, it is shown that the usual quantities of interest (e.g., the solution tuple $(Y_t, Z_t, A_t, Γ_t)$ in the 2FBSDEs) are still of high order accuracy. Several numerical examples are given to show the effective of the proposed numerical schemes. Applications of our numerical schemes for stochastic optimal control problems are also presented.

math.NA↗

arXiv2015

Predicting missing links via significant paths

Link prediction plays an important role in understanding intrinsic evolving mechanisms of networks. With the belief that the likelihood of the existence of a link between two nodes is strongly related with their similarity, many methods have been proposed to calculate node similarity based on node attributes and/or topological structures. Among a large variety of methods that take into account paths connecting the target pair of nodes, most of which neglect the heterogeneity of those paths. Our hypothesis is that a path consisting of small-degree nodes provides a strong evidence of similarity between two ends, accordingly, we propose a so-called sig- nificant path index in this Letter to leverage intermediate nodes' degrees in similarity calculation. Empirical experiments on twelve disparate real networks demonstrate that the proposed index outperforms the mainstream link prediction baselines.

physics.soc-ph↗

arXiv2015

Stochastic collocation on unstructured multivariate meshes

Collocation has become a standard tool for approximation of parameterized systems in the uncertainty quantification (UQ) community. Techniques for least-squares regularization, compressive sampling recovery, and interpolatory reconstruction are becoming standard tools used in a variety of applications. Selection of a collocation mesh is frequently a challenge, but methods that construct geometrically "unstructured" collocation meshes have shown great potential due to attractive theoretical properties and direct, simple generation and implementation. We investigate properties of these meshes, presenting stability and accuracy results that can be used as guides for generating stochastic collocation grids in multiple dimensions.

math.NA↗

arXiv2015

Geometric discord: A resource for increments of quantum key distribution through twirling

In the present work, we consider a scenario where an arbitrary two-qubit pure state is applied to generate a randomly distributed key via the generalized EPR protocol. Using the twirling procedure to convert the pure state into a Werner state, the error rate of the key can be reduced by a factor of $2/3$. This effect indicates that entanglement is not the sufficient resource of the generalized EPR protocol since it is not increased in the twirling procedure. Instead of entanglement, the geometric discord is suggested to be the general quantum resource for this task.

quant-ph↗

arXiv2015

Consistence beats causality in recommender systems

The explosive growth of information challenges people's capability in finding out items fitting to their own interests. Recommender systems provide an efficient solution by automatically push possibly relevant items to users according to their past preferences. Recommendation algorithms usually embody the causality from what having been collected to what should be recommended. In this article, we argue that in many cases, a user's interests are stable, and thus the previous and future preferences are highly consistent. The temporal order of collections then does not necessarily imply a causality relationship. We further propose a consistence-based algorithm that outperforms the state-of-the-art recommendation algorithms in disparate real data sets, including \textit{Netflix}, \textit{MovieLens}, \textit{Amazon} and \textit{Rate Your Music}.

cs.IR↗

arXiv2015

Group-based ranking method for online rating systems with spamming attacks

Ranking problem has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. In this Letter, we propose a group-based ranking method that evaluates users' reputations based on their grouping behaviors. More specifically, users are assigned with high reputation scores if they always fall into large rating groups. Results on three real data sets indicate that the present method is more accurate and robust than correlation-based method in the presence of spamming attacks.

cs.IR↗

arXiv2014

Numerical method for hyperbolic conservation laws via forward backward SDEs

It is well known that for solutions of semi-linear parabolic PDEs, there are equivalent probabilistic interpretations, which yields the so called nonlinear Feymman-Kac formula. By adopting such formula, we consider in this work a novel numerical approach for solutions of hyperbolic conservation laws. Our numerical method consists in efficiently computing the viscosity solutions of conservation laws. However, instead of solving the viscosity problem directly (which is difficult), we find its equivalent probabilistic solution by adopting the Feymman-Kac formula, which relies on solving the equivalent forward backward stochastic differential equations. It is noticed that such framework possesses the following advantages: (i) the viscosity parameter can be chosen sufficiently small (say $10^{-10}$); (ii) the computational procedure on each discretized time level can be \textit{completely parallel}; (iii) the traditional CFL condition is dramatically weakened; (iv) one does not need to handle the transition layers and discertizations of derivatives. Thus, high accuracy viscosity solutions can be efficiently found. Several numerical examples are given to demonstrate the effectiveness of the proposed numerical method.

math.NA↗

arXiv2014

Moiré induced organization of size-selected Pt clusters soft landed on epitaxial graphene

Two-dimensional hexagonal arrays of Pt nanoparticles (1.45 nm diameter) have been obtained by deposition of preformed and size selected Pt80 nanoparticles on graphene. This original self-organization is induced, at room temperature, by the 2D periodic undulation (the moiré pattern) of graphene epitaxially grown on the Ir(111) surface. By means of complementary techniques (scanning tunneling microscopy, grazing incidence X ray scattering), the Pt clusters shapes and organization are characterized and the structural evolution during annealing is investigated. The soft-landed clusters remain quasi-spherical and a large proportion appears to be pinned on specific moiré sites. The quantitative determination of the proportion of organized clusters reveals that the obtained hexagonal array of the almost spherical nanoparticles is stable up to 650 K, which is an indication of a strong cluster-surface interaction.

cond-mat.mes-hall↗