arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 325 records · Page 18Linked to original sources

arXiv2019

Community Detection Across Multiple Social Networks based on Overlapping Users

With the rapid development of Internet technology, online social networks (OSNs) have got fast development and become increasingly popular. Meanwhile, the research works across multiple social networks attract more and more attention from researchers, and community detection is an important one across OSNs for online security problems, such as the user behavior analysis and abnormal community discovery. In this paper, a community detection method is proposed across multiple social networks based on overlapping users. First, the concept of overlapping users is defined, then an algorithm CMN NMF is designed to discover the stub communities from overlapping users based on the social relevance. After that, we extend each stub community in different social networks by adding the users with strong similarity, and in the end different communities are excavated out across networks. Experimental results show the advantage on effectiveness of our method over other methods under real data sets.

cs.SI↗

arXiv2019

Nanosecond Optically Induced Phase Transformation in Compressively Strained BiFeO3 on LaAlO3

Above-bandgap optical illumination induces a transformation from tilted tetragonal-like (T-like) and rhombohedral-like (R-like) phases to an untilted T-like phase in compressively strained BiFeO3. Optical excitation leads to an out-of-plane lattice expansion in the T-like phase. The transformation proceeds in regions with boundaries between the T-like and tilted R-like and tilted T-like phases, consistent with the motion of a boundary. The optically induced transformation indicates that there are new optically driven routes towards nanosecond-scale control of phase transformations in ferroelectrics and multiferroics.

cond-mat.mes-hall↗

arXiv2019

Robustness of the concatenated quantum error-correction protocol against noise for channels affected by fluctuation

In quantum error correction, the description of noise channel cannot be completely accurate, and fluctuation always appears in noise channel. It is found that when fluctuation of physical noise channel is considered, the average effective channel is dependent only on the average of physical noise channel, and the average of physical noise channel here plays the role of the independent error model in the previous works. Now, one may conclude that in the independent error model, the results in previous works are also valid for average channel where fluctuation exists. In some typical cases, our numerical simulations in the concatenated QEC protocol with 5-qubit code, 7-qubit Steane code and 9-qubit Shor confirm this conjecture. For 5-qubit code, the effective channels are approximate to depolarizing channel as the concatenated level increases. For Steane code, the effective channels are approximate to one Pauli channel as the concatenated level increases. For Shor code, the effective channels are approximate to one of Pauli-$X$ and Pauli-$Z$ channels in each level, and in next concatenated level, the effective channels are approximate to the other. Meanwhile, for these codes, the numerical results indicate that the degree of approximation increases with the concatenated level increases, and the fluctuation of noise channel decays exponentially as concatenated QEC performed. On the error-correction threshold, attenuation ratio of standard deviation of channel fidelity roughly has a stable value. On the other hand, standard deviations of off-diagonal elements of quantum process matrix (Pauli Form) decay more quickly than standard deviations of diagonal elements.

quant-ph↗

arXiv2019

Identifying significant edges via neighborhood information

Heterogeneous nature of real networks implies that different edges play different roles in network structure and functions, and thus to identify significant edges is of high value in both theoretical studies and practical applications. We propose the so-called second-order neighborhood (SN) index to quantify an edge's significance in a network. We compare SN index with many other benchmark methods based on 15 real networks via edge percolation. Results show that the proposed SN index outperforms other well-known methods.

physics.soc-ph↗

arXiv2019

A second-order and nonuniform time-stepping maximum-principle preserving scheme for time-fractional Allen-Cahn equations

In this work, we present a second-order nonuniform time-stepping scheme for the time-fractional Allen-Cahn equation. We show that the proposed scheme preserves the discrete maximum principle, and by using the convolution structure of consistency error, we present sharp maximum-norm error estimates which reflect the temporal regularity. As our analysis is built on nonuniform time steps, we may resolve the intrinsic initial singularity by using the graded meshes. Moreover, we propose an adaptive time-stepping strategy for large time simulations. Numerical experiments are presented to show the effectiveness of the proposed scheme. This seems to be the first second-order maximum principle preserving scheme for the time-fractional Allen-Cahn equation.

math.NA↗

arXiv2019

On energy dissipation theory and numerical stability for time-fractional phase field equations

For the time-fractional phase field models, the corresponding energy dissipation law has not been settled on both the continuous level and the discrete level. In this work, we shall address this open issue. More precisely, we prove for the first time that the time-fractional phase field models indeed admit an energy dissipation law of an integral type. In the discrete level, we propose a class of finite difference schemes that can inherit the theoretical energy stability. Our discussion covers the time-fractional gradient systems, including the time-fractional Allen-Cahn equation, the time-fractional Cahn-Hilliard equation, and the time-fractional molecular beam epitaxy models. Numerical examples are presented to confirm the theoretical results. Moreover, a numerical study of the coarsening rate of random initial states depending on the fractional parameter $α$ reveals that there are several coarsening stages for both time-fractional Cahn-Hilliard equation and time-fractional molecular beam epitaxy model, while there exists a $-α/3$ power law coarsening stage.

math.NA↗

arXiv2019

Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms

Link prediction is a significant and challenging task in network science. The majority of known methods are similarity-based, which assign similarity indices for node pairs and assume that two nodes of larger similarity have higher probability to be connected by a link. Due to their simplicity, interpretability and high efficiency, similarity-based methods, in particular those based only on local information, have already found successful applications on disparate fields. In this research domain, an intuitive consensus is that two nodes sharing common neighbors are very likely to have a link, while some recent evidences argue that the number of 3-hop paths more accurately predicts missing links than the number of common neighbors. In this paper, we implement extensive experimental comparisons between 2-hop-based and 3-hop-based similarity indices on 128 real networks. Our results indicate that the 3-hop-based indices perform slightly better with a winning rate about 55.88%, but which index is the best one still depends on the target network. Overall speaking, the class of Cannistraci-Hebb indices performs the best among all considered candidates.

physics.soc-ph↗

arXiv2019

Optimizing spreading dynamics in interconnected networks

Adding edges between layers of interconnected networks is an important way to optimize the spreading dynamics. While previous studies mostly focus on the case of adding a single edge, the theoretical optimal strategy for adding multiple edges still need to be studied. In this study, based on the susceptible-infected-susceptible (SIS) model, we investigate the problem of maximizing the stationary spreading prevalence in interconnected networks. For two isolated networks, we maximize the spreading prevalence near the critical point by choosing multiple interconnecting edges. We present a theoretical analysis based on the discrete-time Markov chain approach to derive the approximate optimal strategy. The optimal inter-layer structure predicted by the strategy maximizes the spreading prevalence, meanwhile minimizes the spreading outbreak threshold for the interconnected network simultaneously. Numerical simulations on synthetic and real-world networks show that near the critical point, the proposed strategy gives better performance than connecting large degree nodes and randomly connecting.

physics.soc-ph↗

arXiv2019

Optimal interlayer structure for promoting spreading of SIS model in two-layer networks

Real-world systems, ranging from social and biological to infrastructural, can be modeled by multilayer networks. Promoting spreading dynamics in multilayer networks may significantly facilitate electronic advertising and predicting popular scientific publications. In this study, we propose a strategy for promoting the spreading dynamics of the susceptible-infected-susceptible model by adding one interconnecting edge between two isolated networks. By applying a perturbation method to the discrete Markovian chain approach, we derive an index that estimates the spreading prevalence in the interconnected network. The index can be interpreted as a variant of Katz centrality, where the adjacency matrix is replaced by a weighted matrix with weights depending on the dynamical information of the spreading process. Edges that are less infected at one end and its neighborhood but highly infected at the other will have larger weights. We verify the effectiveness of the proposed strategy on small networks by exhaustively examining all latent edges and demonstrate that performance is optimal or near-optimal. For large synthetic and real-world networks, the proposed method always outperforms other static strategies such as connecting nodes with the highest degree or eigenvector centrality.

physics.soc-ph↗

arXiv2019

Coevolution spreading in complex networks

The propagations of diseases, behaviors and information in real systems are rarely independent of each other, but they are coevolving with strong interactions. To uncover the dynamical mechanisms, the evolving spatiotemporal patterns and critical phenomena of networked coevolution spreading are extremely important, which provide theoretical foundations for us to control epidemic spreading, predict collective behaviors in social systems, and so on. The coevolution spreading dynamics in complex networks has thus attracted much attention in many disciplines. In this review, we introduce recent progress in the study of coevolution spreading dynamics, emphasizing the contributions from the perspectives of statistical mechanics and network science. The theoretical methods, critical phenomena, phase transitions, interacting mechanisms, and effects of network topology for four representative types of coevolution spreading mechanisms, including the coevolution of biological contagions, social contagions, epidemic-awareness, and epidemic-resources, are presented in detail, and the challenges in this field as well as open issues for future studies are also discussed.

physics.soc-ph↗

arXiv2019

Hierarchical Clustering Supported by Reciprocal Nearest Neighbors

Clustering is a fundamental analysis tool aiming at classifying data points into groups based on their similarity or distance. It has found successful applications in all natural and social sciences, including biology, physics, economics, chemistry, astronomy, psychology, and so on. Among numerous existent algorithms, hierarchical clustering algorithms are of a particular advantage as they can provide results under different resolutions without any predetermined number of clusters and unfold the organization of resulted clusters. At the same time, they suffer a variety of drawbacks and thus are either time-consuming or inaccurate. We propose a novel hierarchical clustering approach on the basis of a simple hypothesis that two reciprocal nearest data points should be grouped in one cluster. Extensive tests on data sets across multiple domains show that our method is much faster and more accurate than the state-of-the-art benchmarks. We further extend our method to deal with the community detection problem in real networks, achieving remarkably better results in comparison with the well-known Girvan-Newman algorithm.

cs.IR↗

arXiv2019

Identifying vital nodes based on reverse greedy method

The identification of vital nodes that maintain the network connectivity is a long-standing challenge in network science. In this paper, we propose a so-called reverse greedy method where the least important nodes are preferentially chosen to make the size of the largest component in the corresponding induced subgraph as small as possible. Accordingly, the nodes being chosen later are more important in maintaining the connectivity. Empirical analyses on ten real networks show that the reverse greedy method performs remarkably better than well-known state-of-the-art methods.

physics.soc-ph↗

arXiv2019

Destination Choice Game: A Spatial Interaction Theory on Human Mobility

With remarkable significance in migration prediction, global disease mitigation, urban planning and many others, an arresting challenge is to predict human mobility fluxes between any two locations. A number of methods have been proposed against the above challenge, including the gravity model, the intervening opportunity model, the radiation model, the population-weighted opportunity model, and so on. Despite their theoretical elegance, all models ignored an intuitive and important ingredient in individual decision about where to go, that is, the possible congestion on the way and the possible crowding in the destination. Here we propose a microscopic mechanism underlying mobility decisions, named destination choice game (DCG), which takes into account the crowding effects resulted from spatial interactions among individuals. In comparison with the state-of-the-art models, the present one shows more accurate prediction on mobility fluxes across wide scales from intracity trips to intercity travels, and further to internal migrations. The well-known gravity model is proved to be the equilibrium solution of a degenerated DCG neglecting the crowding effects in the destinations.

physics.soc-ph↗

arXiv2019

Impurity-induced resonant states in topological nodal-line semimetals

Nodal-line semimetals are characterized by a kind of topologically nontrivial bulk-band crossing, giving rise to almost flat surface states. Yet, a direct evidence of the surface states is still lacking. Here we study theoretically impurity effects in topological nodal-line semimetals based on the T-matrix method. It is found that for a bulk impurity, some in-gap states may be induced near the impurity site, while the visible resonant impurity state can only exist for certain strength of the impurity potentials. For a surface impurity, robust resonant impurity states exist in a wide range of impurity potentials. Such robust resonant states stem from the topological protected weak dispersive surface states, which can be probed by scanning tunneling microscopy, providing a strong signature of the topological surface states in the nodal-line semimetals.

cond-mat.mes-hall↗

arXiv2019

Computational Socioeconomics

Uncovering the structure of socioeconomic systems and timely estimation of socioeconomic status are significant for economic development. The understanding of socioeconomic processes provides foundations to quantify global economic development, to map regional industrial structure, and to infer individual socioeconomic status. In this review, we will make a brief manifesto about a new interdisciplinary research field named Computational Socioeconomics, followed by detailed introduction about data resources, computational tools, data-driven methods, theoretical models and novel applications at multiple resolutions, including the quantification of global economic inequality and complexity, the map of regional industrial structure and urban perception, the estimation of individual socioeconomic status and demographic, and the real-time monitoring of emergent events. This review, together with pioneering works we have highlighted, will draw increasing interdisciplinary attentions and induce a methodological shift in future socioeconomic studies.

physics.soc-ph↗

arXiv2019

Rational spectral methods for PDEs involving fractional Laplacian in unbounded domains

Many PDEs involving fractional Laplacian are naturally set in unbounded domains with underlying solutions decay very slowly, subject to certain power laws. Their numerical solutions are under-explored. This paper aims at developing accurate spectral methods using rational basis (or modified mapped Gegenbauer functions) for such models in unbounded domains. The main building block of the spectral algorithms is the explicit representations for the Fourier transform and fractional Laplacian of the rational basis, derived from some useful integral identites related to modified Bessel functions. With these at our disposal, we can construct rational spectral-Galerkin and direct collocation schemes by pre-computing the associated fractional differentiation matrices. We obtain optimal error estimates of rational spectral approximation in the fractional Sobolev spaces, and analyze the optimal convergence of the proposed Galerkin scheme. We also provide ample numerical results to show that the rational method outperforms the Hermite function approach.

math.NA↗

arXiv2019

Robust Visual Tracking Revisited: From Correlation Filter to Template Matching

In this paper, we propose a novel matching based tracker by investigating the relationship between template matching and the recent popular correlation filter based trackers (CFTs). Compared to the correlation operation in CFTs, a sophisticated similarity metric termed "mutual buddies similarity" (MBS) is proposed to exploit the relationship of multiple reciprocal nearest neighbors for target matching. By doing so, our tracker obtains powerful discriminative ability on distinguishing target and background as demonstrated by both empirical and theoretical analyses. Besides, instead of utilizing single template with the improper updating scheme in CFTs, we design a novel online template updating strategy named "memory filtering" (MF), which aims to select a certain amount of representative and reliable tracking results in history to construct the current stable and expressive template set. This scheme is beneficial for the proposed tracker to comprehensively "understand" the target appearance variations, "recall" some stable results. Both qualitative and quantitative evaluations on two benchmarks suggest that the proposed tracking method performs favorably against some recently developed CFTs and other competitive trackers.

cs.CV↗

arXiv2019

Predicting Academic Performance for College Students: A Campus Behavior Perspective

Detecting abnormal behaviors of students in time and providing personalized intervention and guidance at the early stage is important in educational management. Academic performance prediction is an important building block to enabling this pre-intervention and guidance. Most of the previous studies are based on questionnaire surveys and self-reports, which suffer from small sample size and social desirability bias. In this paper, we collect longitudinal behavioral data from 6,597 students' smart cards and propose three major types of discriminative behavioral factors, diligence, orderliness, and sleep patterns. Empirical analysis demonstrates these behavioral factors are strongly correlated with academic performance. Furthermore, motivated by social influence theory, we analyze the correlation between each student's academic performance with his/her behaviorally similar students'. Statistical tests indicate this correlation is significant. Based on these factors, we further build a multi-task predictive framework based on a learning-to-rank algorithm for academic performance prediction. This framework captures inter-semester correlation, inter-major correlation and integrates student similarity to predict students' academic performance. The experiments on a large-scale real-world dataset show the effectiveness of our methods for predicting academic performance and the effectiveness of proposed behavioral factors.

cs.CY↗