arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 379 records · Page 21Linked to original sources

arXiv2017

6.2-GHz modulated terahertz light detection using fast terahertz quantum well photodetectors

The fast detection of terahertz radiation is of great importance for various applications such as fast imaging, high speed communications, and spectroscopy. Most commercial products capable of sensitively responding the terahertz radiation are thermal detectors, i.e., pyroelectric sensors and bolometers. This class of terahertz detectors is normally characterized by low modulation frequency (dozens or hundreds of Hz). Here we demonstrate the first fast semiconductor-based terahertz quantum well photodetectors by carefully designing the device structure and microwave transmission line for high frequency signal extraction. Modulation response bandwidth of gigahertz level is obtained. As an example, the 6.2-GHz modulated terahertz light emitted from a Fabry-Pérot terahertz quantum cascade laser is successfully detected using the fast terahertz quantum well photodetector. In addition to the fast terahertz detection, the technique presented in this work can also facilitate the frequency stability or phase noise characterizations for terahertz quantum cascade lasers.

physics.optics↗

arXiv2017

Bounds of memory strength for power-law series

Many time series produced by complex systems are empirically found to follow power-law distributions with different exponents $α$. By permuting the independently drawn samples from a power-law distribution, we present non-trivial bounds on the memory strength (1st-order autocorrelation) as a function of $α$, which are markedly different from the ordinary $\pm 1$ bounds for Gaussian or uniform distributions. When $1 < α\leq 3$, as $α$ grows bigger, the upper bound increases from 0 to +1 while the lower bound remains 0; when $α> 3$, the upper bound remains +1 while the lower bound descends below 0. Theoretical bounds agree well with numerical simulations. Based on the posts on Twitter, ratings of MovieLens, calling records of the mobile operator Orange, and browsing behavior of Taobao, we find that empirical power-law distributed data produced by human activities obey such constraints. The present findings explain some observed constraints in bursty time series and scale-free networks, and challenge the validity of measures like autocorrelation and assortativity coefficient in heterogeneous systems.

physics.data-an↗

arXiv2017

Possible spin excitation structure in monolayer FeSe grown on SrTiO$_{3}$

Based on recent high-resolution angle-resolved photoemission spectroscopy measurement in monolayer FeSe grown on SrTiO$_{3}$, we constructed a tight-binding model and proposed a superconducting (SC) pairing function which can well fit the observed band structure and SC gap anisotropy. Then we investigated the spin excitation spectra in order to determine the possible sign structure of the SC order parameter. We found that a resonance-like spin excitation may occur if the SC order parameter changes sign along the Fermi surfaces. However, this resonance is located at different locations in momentum space compared to other FeSe-based superconductors, suggesting that the Fermi surface shape and pairing symmetry in monolayer FeSe grown on SrTiO$_{3}$ may be different from other FeSe-based superconductors.

cond-mat.supr-con↗

arXiv2017

Collective Learning in China's Regional Economic Development

Industrial development is the process by which economies learn how to produce new products and services. But how do economies learn? And who do they learn from? The literature on economic geography and economic development has emphasized two learning channels: inter-industry learning, which involves learning from related industries; and inter-regional learning, which involves learning from neighboring regions. Here we use 25 years of data describing the evolution of China's economy between 1990 and 2015--a period when China multiplied its GDP per capita by a factor of ten--to explore how Chinese provinces diversified their economies. First, we show that the probability that a province will develop a new industry increases with the number of related industries that are already present in that province, a fact that is suggestive of inter-industry learning. Also, we show that the probability that a province will develop an industry increases with the number of neighboring provinces that are developed in that industry, a fact suggestive of inter-regional learning. Moreover, we find that the combination of these two channels exhibit diminishing returns, meaning that the contribution of either of these learning channels is redundant when the other one is present. Finally, we address endogeneity concerns by using the introduction of high-speed rail as an instrument to isolate the effects of inter-regional learning. Our differences-in-differences (DID) analysis reveals that the introduction of high speed-rail increased the industrial similarity of pairs of provinces connected by high-speed rail. Also, industries in provinces that were connected by rail increased their productivity when they were connected by rail to other provinces where that industry was already present. These findings suggest that inter-regional and inter-industry learning played a role in China's great economic expansion.

econ.GN↗

arXiv2017

Mechanism Design in Social Networks

This paper studies an auction design problem for a seller to sell a commodity in a social network, where each individual (the seller or a buyer) can only communicate with her neighbors. The challenge to the seller is to design a mechanism to incentivize the buyers, who are aware of the auction, to further propagate the information to their neighbors so that more buyers will participate in the auction and hence, the seller will be able to make a higher revenue. We propose a novel auction mechanism, called information diffusion mechanism (IDM), which incentivizes the buyers to not only truthfully report their valuations on the commodity to the seller, but also further propagate the auction information to all their neighbors. In comparison, the direct extension of the well-known Vickrey-Clarke-Groves (VCG) mechanism in social networks can also incentivize the information diffusion, but it will decrease the seller's revenue or even lead to a deficit sometimes. The formalization of the problem has not yet been addressed in the literature of mechanism design and our solution is very significant in the presence of large-scale online social networks.

cs.GT↗

arXiv2017

Suboptimum Low Complexity Joint Multi-target Detection and Localization for Noncoherent MIMO Radar with Widely Separated Antennas

In this paper, the problems of simultaneously detecting and localizing multiple targets are considered for noncoherent multiple-input multiple-output (MIMO) radar with widely separated antennas. By assuming a prior knowledge of target number, an optimal solution to this problem is presented first. It is essentially a maximum-likelihood (ML) estimator searching parameters of interest in a high dimensional space. However, the complexity of this method increases exponentially with the number G of targets.Besides, without the prior information of the number of targets, a multi-hypothesis testing strategy to determine the number of targets is required, which further complicates this method. Therefore, we split the joint maximization into G disjoint optimization problems by clearing the interference from previously declared targets. In this way, we derive two fast and robust suboptimal solutions which allow trading performance for a much lower implementation complexity which is almost independent of the number of targets. In addition, the multi-hypothesis testing is no longer required when target number is unknown. Simulation results show the proposed algorithms can correctly detect and accurately localize multiple targets even when targets share common range bins in some paths.

cs.IT↗

arXiv2016

Fast asynchronous updating algorithms for k-shell indices

Identifying influential nodes in networks is a significant and challenging task. Among many centrality indices, the $k$-shell index performs very well in finding out influential spreaders. However, the traditional method for calculating the $k$-shell indices of nodes needs the global topological information, which limits its applications in large-scale dynamically growing networks. Recently, L\@ü \emph{et al.} [Nature Communications 7 (2016) 10168] proposed a novel asynchronous algorithm to calculate the $k$-shell indices, which is suitable to deal with large-scale growing networks. In this paper, we propose two algorithms to select nodes and update their intermediate values towards the $k$-shell indices, which can help in accelerating the convergence of the calculation of $k$-shell indices. The former algorithm takes into account the degrees of nodes while the latter algorithm prefers to choose the node whose neighbors' values have been changed recently. We test these two methods on four real networks and three artificial networks. The results suggest that the two algorithms can respectively reduce the convergence time up to 75.4\% and 92.9\% in average, compared with the original asynchronous updating algorithm.

physics.soc-ph↗

arXiv2016

A vertex similarity index for better personalized recommendation

Recommender systems benefit us in tackling the problem of information overload by predicting our potential choices among diverse niche objects. So far, a variety of personalized recommendation algorithms have been proposed and most of them are based on similarities, such as collaborative filtering and mass diffusion. Here, we propose a novel vertex similarity index named CosRA, which combines advantages of both the cosine index and the resource-allocation (RA) index. By applying the CosRA index to real recommender systems including MovieLens, Netflix and RYM, we show that the CosRA-based method has better performance in accuracy, diversity and novelty than some benchmark methods. Moreover, the CosRA index is free of parameters, which is a significant advantage in real applications. Further experiments show that the introduction of two turnable parameters cannot remarkably improve the overall performance of the CosRA index.

cs.IR↗

arXiv2016

Critical size of ego communication networks

With the help of information and communication technologies, studies on the overall social networks have been extensively reported recently. However, investigations on the directed Ego Communication Networks (ECNs) remain insufficient, where an ECN stands for a sub network composed of a centralized individual and his/her direct contacts. In this paper, the directed ECNs are built on the Call Detail Records (CDRs), which cover more than 7 million people of a provincial capital city in China for half a year. Results show that there is a critical size for ECN at about 150, above which the average emotional closeness between ego and alters drops, the balanced relationship between ego and network collapses, and the proportion of strong ties decreases. This paper not only demonstrate the significance of ECN size in affecting its properties, but also shows accordance with the "Dunbar's Number". These results can be viewed as a cross-culture supportive evidence to the well-known Social Brain Hypothesis (SBH).

physics.soc-ph↗

arXiv2016

Correlation between social proximity and mobility similarity

Human behaviors exhibit ubiquitous correlations in many aspects, such as individual and collective levels, temporal and spatial dimensions, content, social and geographical layers. With rich Internet data of online behaviors becoming available, it attracts academic interests to explore human mobility similarity from the perspective of social network proximity. Existent analysis shows a strong correlation between online social proximity and offline mobility similari- ty, namely, mobile records between friends are significantly more similar than between strangers, and those between friends with common neighbors are even more similar. We argue the importance of the number and diversity of com- mon friends, with a counter intuitive finding that the number of common friends has no positive impact on mobility similarity while the diversity plays a key role, disagreeing with previous studies. Our analysis provides a novel view for better understanding the coupling between human online and offline behaviors, and will help model and predict human behaviors based on social proximity.

physics.soc-ph↗

arXiv2016

Optimal programmable unambiguous discriminator between two unknown latitudinal states

Two unknown states can be unambiguously distinguished by a universal programmable discriminator, which has been widely discussed in previous works and the optimal solution has also been obtained. In this paper, we investigate the programmable unambiguous discriminator between two unknown "latitudinal" states, which lie in a subspace of the total state space. By equivalence of unknown pure states to known average mixed states, the optimal solution for this problem is systematically derived, and the analytical success probabilities for the optimal unambiguous discrimination are obtained. It is beyond one's expectation that the optimal setting for the programmable unambiguous discrimination between two unknown "latitudinal" states is the same as that for the universal ones. The results in this work can be used for the realization of the programmable discriminator in laboratory.

quant-ph↗

arXiv2016

Efficient spectral sparse grid approximations for solving multi-dimensional forward backward SDEs

This is the second part in a series of papers on multi-step schemes for solving coupled forward backward stochastic differential equations (FBSDEs). We extend the basic idea in our former paper [W. Zhao, Y. Fu and T. Zhou, SIAM J. Sci. Comput., 36 (2014), pp. A1731-A1751] to solve high-dimensional FBSDEs, by using the spectral sparse grid approximations. The main issue for solving high dimensional FBSDEs is to build an efficient spatial discretization, and deal with the related high dimensional conditional expectations and interpolations. In this work, we propose the sparse grid spatial discretization. We use the sparse grid Gaussian-Hermite quadrature rule to approximate the conditional expectations. And for the associated high dimensional interpolations, we adopt an spectral expansion of functions in polynomial spaces with respect to the spatial variables, and use the sparse grid approximations to recover the expansion coefficients. The FFT algorithm is used to speed up the recovery procedure, and the entire algorithm admits efficient and high accurate approximations in high-dimensions, provided that the solutions are sufficiently smooth. Several numerical examples are presented to demonstrate the efficiency of the proposed methods.

math.NA↗

arXiv2016

Stochastic collocation methods via $L_1$ minimization using randomized quadratures

In this work, we discuss the problem of approximating a multivariate function via $\ell_1$ minimization method, using a random chosen sub-grid of the corresponding tensor grid of Gaussian points. The independent variables of the function are assumed to be random variables, and thus, the framework provides a non-intrusive way to construct the generalized polynomial chaos expansions, stemming from the motivating application of Uncertainty Quantification (UQ). We provide theoretical analysis on the validity of the approach. The framework includes both the bounded measures such as the uniform and the Chebyshev measure, and the unbounded measures which include the Gaussian measure. Several numerical examples are given to confirm the theoretical results.

math.NA↗

arXiv2016

Vital nodes identification in complex networks

Real networks exhibit heterogeneous nature with nodes playing far different roles in structure and function. To identify vital nodes is thus very significant, allowing us to control the outbreak of epidemics, to conduct advertisements for e-commercial products, to predict popular scientific publications, and so on. The vital nodes identification attracts increasing attentions from both computer science and physical societies, with algorithms ranging from simply counting the immediate neighbors to complicated machine learning and message passing approaches. In this review, we clarify the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art. Furthermore, we provide extensive empirical analyses to compare well-known methods on disparate real networks, and highlight the future directions. In despite of the emphasis on physics-rooted approaches, the unification of the language and comparison with cross-domain methods would trigger interdisciplinary solutions in the near future.

physics.soc-ph↗

arXiv2016

Link Prediction via Matrix Completion

Inspired by practical importance of social networks, economic networks, biological networks and so on, studies on large and complex networks have attracted a surge of attentions in the recent years. Link prediction is a fundamental issue to understand the mechanisms by which new links are added to the networks. We introduce the method of robust principal component analysis (robust PCA) into link prediction, and estimate the missing entries of the adjacency matrix. On one hand, our algorithm is based on the sparsity and low rank property of the matrix, on the other hand, it also performs very well when the network is dense. This is because a relatively dense real network is also sparse in comparison to the complete graph. According to extensive experiments on real networks from disparate fields, when the target network is connected and sufficiently dense, whatever it is weighted or unweighted, our method is demonstrated to be very effective and with prediction accuracy being considerably improved comparing with many state-of-the-art algorithms.

cs.SI↗

arXiv2016

Identifying the Academic Rising Stars

Predicting the fast-rising young researchers (Academic Rising Stars) in the future provides useful guidance to the research community, e.g., offering competitive candidates to university for young faculty hiring as they are expected to have success academic careers. In this work, given a set of young researchers who have published the first first-author paper recently, we solve the problem of how to effectively predict the top k% researchers who achieve the highest citation increment in Δt years. We explore a series of factors that can drive an author to be fast-rising and design a novel impact increment ranking learning (IIRL) algorithm that leverages those factors to predict the academic rising stars. Experimental results on the large ArnetMiner dataset with over 1.7 million authors demonstrate the effectiveness of IIRL. Specifically, it outperforms all given benchmark methods, with over 8% average improvement. Further analysis demonstrates that the prediction models for different research topics follow the similar pattern. We also find that temporal features are the best indicators for rising stars prediction, while venue features are less relevant.

cs.DL↗

arXiv2016

Explosive spreading on complex networks: the role of synergy

In spite of the vast literature on spreading dynamics on complex networks, the role of local synergy, i.e., the interaction of elements that when combined produce a total effect greater than the sum of the individualelements, has been studied but only for irreversible spreading dynamics. Reversible spreading dynamics are ubiquitous but their interplay with synergy has remained unknown. To fill this knowledge gap, we articulate a model to incorporate local synergistic effect into the classical susceptible-infected-susceptible process, in which the probability for a susceptible node to become infected through an infected neighbor is enhanced when the neighborhood of the latter contains a number of infected nodes. We derive master equations incorporating the synergistic effect, with predictions that agree well with the numerical results. A striking finding is that, when a parameter characterizing the strength of the synergy reinforcement effect is above a critical value, the steady state density of the infected nodes versus the basic transmission rate exhibits an explosively increasing behavior and a hysteresis loop emerges. In fact, increasing the synergy strength can promote the spreading and reduce the invasion and persistence thresholds of the hysteresis loop. A physical understanding of the synergy promoting explosive spreading and the associated hysteresis behavior can be obtained through a mean-field analysis.

physics.soc-ph↗

arXiv2016

Indigenization of Urban Mobility

The identification of urban mobility patterns is very important for predicting and controlling spatial events. In this study, we analyzed millions of geographical check-ins crawled from a leading Chinese location-based social networking service (Jiepang.com), which contains demographic information that facilitates group-specific studies. We determined the distinct mobility patterns of natives and non-natives in all five large cities that we considered. We used a mixed method to assign different algorithms to natives and non-natives, which greatly improved the accuracy of location prediction compared with the basic algorithms. We also propose so-called indigenization coefficients to quantify the extent to which an individual behaves like a native, which depends only on their check-in behavior, rather than requiring demographic information. Surprisingly, the hybrid algorithm weighted using the indigenization coefficients outperformed a mixed algorithm that used additional demographic information, suggesting the advantage of behavioral data in characterizing individual mobility compared with the demographic information. The present location prediction algorithms can find applications in urban planning, traffic forecasting, mobile recommendation, and so on.

physics.soc-ph↗