arXiv subjects

Wei Pan

Publications and source records attributed to Wei Pan.

213 records · Page 12Linked to original sources

arXiv2014

Superradiant Decay of Cyclotron Resonance of Two-Dimensional Electron Gases

We report on the observation of collective radiative decay, or superradiance, of cyclotron resonance (CR) in high-mobility two-dimensional electron gases in GaAs quantum wells using time-domain terahertz magnetospectroscopy. The decay rate of coherent CR oscillations increases linearly with the electron density in a wide range, which is a hallmark of superradiant damping. Our fully quantum mechanical theory provides a universal formula for the decay rate, which reproduces our experimental data without any adjustable parameter. These results firmly establish the many-body nature of CR decoherence in this system, despite the fact that the CR frequency is immune to electron-electron interactions due to Kohn's theorem.

cond-mat.mes-hall↗

arXiv2014

Wide-open, high-resolution microwave/millimeter-wave Doppler frequency shift estimation using photonics technology

Today, wide-open, high-resolution Doppler frequency shift (DFS) estimation is essential for radar, microwave/millimeter-wave, and communication systems. Using photonics technology, an effective approach is proposed and experimentally demonstrated, providing a high-resolution and frequency-independent solution. In the approach consisting of two cascaded opto-electronic modulators, DFS between the transmitted microwave/ millimeter-wave signal and the received echo signal is mapped into a doubled spacing between two target optical sidebands. Subsequently, the DFS is then estimated through the spectrum analysis of a generated low-frequency electrical signal, with an improved resolution by a factor of 2. In experiments, DFSs from -90 to 90 KHz are successfully estimated for microwave/millimeter-wave signals at 10, 15, and 30 GHz, where estimation errors keep lower than +/- 5e-10 Hz. For radial velocity measurement, these results reveal a range from 0 to 900 m/s (0 to 450 m/s) and a resolution of 1e-11 m/s (5e-12 m/s) at 15-GHz (30-GHz) frequency band.

physics.optics↗

arXiv2014

Distributed Reconstruction of Nonlinear Networks: An ADMM Approach

In this paper, we present a distributed algorithm for the reconstruction of large-scale nonlinear networks. In particular, we focus on the identification from time-series data of the nonlinear functional forms and associated parameters of large-scale nonlinear networks. Recently, a nonlinear network reconstruction problem was formulated as a nonconvex optimisation problem based on the combination of a marginal likelihood maximisation procedure with sparsity inducing priors. Using a convex-concave procedure (CCCP), an iterative reweighted lasso algorithm was derived to solve the initial nonconvex optimisation problem. By exploiting the structure of the objective function of this reweighted lasso algorithm, a distributed algorithm can be designed. To this end, we apply the alternating direction method of multipliers (ADMM) to decompose the original problem into several subproblems. To illustrate the effectiveness of the proposed methods, we use our approach to identify a network of interconnected Kuramoto oscillators with different network sizes (500~100,000 nodes).

math.OC↗

arXiv2014

Superconducting proximity effect in inverted InAs/GaSb quantum well structures with Ta electrodes

We present our recent electronic transport results in top-gated InAs/GaSb quantum well hybrid structures with superconducting Ta electrodes. We show that the transport across the InAs-Ta junction depends largely on the interfacial transparency, exhibiting distinct zero-bias behavior. For a relatively resistive interface a broad conductance peak is observed at zero bias. When a transparent InAs-Ta interface is achieved, a zero-bias conductance dip appears with two coherent-peak-like features forming at bias voltages corresponding to the superconducting gap of Ta. The conductance spectra of the transparent InAs-Ta junction at different gate voltages can be fit well using the standard Blonder-Tinkham-Klapwijk theory.

cond-mat.mes-hall↗

arXiv2013

Probing terahertz surface plasmon waves in graphene structures

Epitaxial graphene mesas and ribbons are investigated using terahertz (THz) nearfield microscopy to probe surface plasmon excitation and THz transmission properties on the sub-wavelength scale. The THz near-field images show variation of graphene properties on a scale smaller than the wavelength, and excitation of THz surface waves occurring at graphene edges, similar to that observed at metallic edges. The Fresnel reflection at the substrate SiC/air interface is also found to be altered by the presence of graphene ribbon arrays, leading to either reduced or enhanced transmission of the THz wave depending on the wave polarization and the ribbon width.

cond-mat.mes-hall↗

arXiv2013

Urban characteristics attributable to density-driven tie formation

Motivated by empirical evidence on the interplay between geography, population density and societal interaction, we propose a generative process for the evolution of social structure in cities. Our analytical and simulation results predict both super-linear scaling of social tie density and information flow as a function of the population. We demonstrate that our model provides a robust and accurate fit for the dependency of city characteristics with city size, ranging from individual-level dyadic interactions (number of acquaintances, volume of communication) to population-level variables (contagious disease rates, patenting activity, economic productivity and crime) without the need to appeal to modularity, specialization, or hierarchy.

physics.soc-ph↗

arXiv2013

Dineutron correlations and BCS-BEC crossover in nuclear matter with the Gogny pairing force

The dineutron correlations and the crossover from superfluidity of neutron Cooper pairs in the $^1S_0$ pairing channel to Bose-Einstein condensation (BEC) of dineutron pairs in both symmetric and neutron matter are studied within the relativistic Hartree-Bogoliubov theory, with the effective interaction PK1 of the relativistic mean-field approach in the particle-hole channel and the finite-range Gogny force in the particle-particle channel. The influence of the pairing strength on the behaviors of dineutron correlations is investigated. It is found that the neutron pairing gaps at the Fermi surface from three adopted Gogny interactions are smaller at low densities than the one from the bare nucleon-nucleon interaction Bonn-B potential. From the normal (anomalous) density distribution functions and the density correlation function, it is confirmed that a true dineutron BEC state does not appear in nuclear matter. In the cases of the Gogny interactions, the most BEC-like state may appear when the neutron Fermi momentum $k_{Fn}\thicksim0.3 \rm{fm^{-1}}$. Moreover, based on the newly developed criterion for several characteristic quantities within the relativistic framework, the BCS-BEC crossover is supposed to realize in a revised density region with $k_{Fn}\in[0.15,0.63] \rm{fm^{-1}}$ in nuclear matter.

nucl-th↗

arXiv2012

Reconstruction of Arbitrary Biochemical Reaction Networks: A Compressive Sensing Approach

Reconstruction of biochemical reaction networks is a central topic in systems biology which raises crucial theoretical challenges in system identification. Nonlinear Ordinary Differential Equations (ODEs) that involve polynomial and rational functions are typically used to model biochemical reaction networks. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data quite difficult. In this paper, we present a network reconstruction algorithm that can deal with model descriptions under the form of polynomial and rational functions. Rather than identifying the parameters of linear or nonlinear ODEs characterised by pre-defined equation structures, our methodology allows us to determine the nonlinear ODEs structure together with their associated reaction constants. To solve the network reconstruction problem, we cast it as a Compressive Sensing (CS) problem and use Bayesian Sparse Learning (BSL) algorithms as an efficient way to obtain its solution.

eess.SY↗

arXiv2012

Bayesian joint modeling of multiple gene networks and diverse genomic data to identify target genes of a transcription factor

We consider integrative modeling of multiple gene networks and diverse genomic data, including protein-DNA binding, gene expression and DNA sequence data, to accurately identify the regulatory target genes of a transcription factor (TF). Rather than treating all the genes equally and independently a priori in existing joint modeling approaches, we incorporate the biological prior knowledge that neighboring genes on a gene network tend to be (or not to be) regulated together by a TF. A key contribution of our work is that, to maximize the use of all existing biological knowledge, we allow incorporation of multiple gene networks into joint modeling of genomic data by introducing a mixture model based on the use of multiple Markov random fields (MRFs). Another important contribution of our work is to allow different genomic data to be correlated and to examine the validity and effect of the independence assumption as adopted in existing methods. Due to a fully Bayesian approach, inference about model parameters can be carried out based on MCMC samples. Application to an E. coli data set, together with simulation studies, demonstrates the utility and statistical efficiency gains with the proposed joint model.

stat.AP↗

arXiv2012

Modeling Dynamical Influence in Human Interaction Patterns

How can we model influence between individuals in a social system, even when the network of interactions is unknown? In this article, we review the literature on the "influence model," which utilizes independent time series to estimate how much the state of one actor affects the state of another actor in the system. We extend this model to incorporate dynamical parameters that allow us to infer how influence changes over time, and we provide three examples of how this model can be applied to simulated and real data. The results show that the model can recover known estimates of influence, it generates results that are consistent with other measures of social networks, and it allows us to uncover important shifts in the way states may be transmitted between actors at different points in time.

cs.SI↗

arXiv2011

Trends Prediction Using Social Diffusion Models

The importance of the ability of predict trends in social media has been growing rapidly in the past few years with the growing dominance of social media in our everyday's life. Whereas many works focus on the detection of anomalies in networks, there exist little theoretical work on the prediction of the likelihood of anomalous network pattern to globally spread and become "trends". In this work we present an analytic model the social diffusion dynamics of spreading network patterns. Our proposed method is based on information diffusion models, and is capable of predicting future trends based on the analysis of past social interactions between the community's members. We present an analytic lower bound for the probability that emerging trends would successful spread through the network. We demonstrate our model using two comprehensive social datasets - the "Friends and Family" experiment that was held in MIT for over a year, where the complete activity of 140 users was analyzed, and a financial dataset containing the complete activities of over 1.5 million members of the "eToro" social trading community.

cs.SI↗

arXiv2011

Composite Social Network for Predicting Mobile Apps Installation

We have carefully instrumented a large portion of the population living in a university graduate dormitory by giving participants Android smart phones running our sensing software. In this paper, we propose the novel problem of predicting mobile application (known as "apps") installation using social networks and explain its challenge. Modern smart phones, like the ones used in our study, are able to collect different social networks using built-in sensors. (e.g. Bluetooth proximity network, call log network, etc) While this information is accessible to app market makers such as the iPhone AppStore, it has not yet been studied how app market makers can use these information for marketing research and strategy development. We develop a simple computational model to better predict app installation by using a composite network computed from the different networks sensed by phones. Our model also captures individual variance and exogenous factors in app adoption. We show the importance of considering all these factors in predicting app installations, and we observe the surprising result that app installation is indeed predictable. We also show that our model achieves the best results compared with generic approaches: our results are four times better than random guess, and predict almost 45% of all apps users install with almost 45% precision (F1 score= 0.43).

cs.SI↗

arXiv2010

Time Critical Social Mobilization: The DARPA Network Challenge Winning Strategy

It is now commonplace to see the Web as a platform that can harness the collective abilities of large numbers of people to accomplish tasks with unprecedented speed, accuracy and scale. To push this idea to its limit, DARPA launched its Network Challenge, which aimed to "explore the roles the Internet and social networking play in the timely communication, wide-area team-building, and urgent mobilization required to solve broad-scope, time-critical problems." The challenge required teams to provide coordinates of ten red weather balloons placed at different locations in the continental United States. This large-scale mobilization required the ability to spread information about the tasks widely and quickly, and to incentivize individuals to act. We report on the winning team's strategy, which utilized a novel recursive incentive mechanism to find all balloons in under nine hours. We analyze the theoretical properties of the mechanism, and present data about its performance in the challenge.

cs.CY↗

arXiv2009

Computations modulo regular chains

The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular methods and fast polynomial arithmetic. Our strategies take also advantage of the context in which these operations are performed. We report on extensive experimentation, comparing our code to pre-existing Maple implementations, as well as more optimized Magma functions. In most cases, our new code outperforms the other packages by several orders of magnitude.

cs.SC↗

arXiv2008

Penalized model-based clustering with cluster-specific diagonal covariance matrices and grouped variables

Clustering analysis is one of the most widely used statistical tools in many emerging areas such as microarray data analysis. For microarray and other high-dimensional data, the presence of many noise variables may mask underlying clustering structures. Hence removing noise variables via variable selection is necessary. For simultaneous variable selection and parameter estimation, existing penalized likelihood approaches in model-based clustering analysis all assume a common diagonal covariance matrix across clusters, which however may not hold in practice. To analyze high-dimensional data, particularly those with relatively low sample sizes, this article introduces a novel approach that shrinks the variances together with means, in a more general situation with cluster-specific (diagonal) covariance matrices. Furthermore, selection of grouped variables via inclusion or exclusion of a group of variables altogether is permitted by a specific form of penalty, which facilitates incorporating subject-matter knowledge, such as gene functions in clustering microarray samples for disease subtype discovery. For implementation, EM algorithms are derived for parameter estimation, in which the M-steps clearly demonstrate the effects of shrinkage and thresholding. Numerical examples, including an application to acute leukemia subtype discovery with microarray gene expression data, are provided to demonstrate the utility and advantage of the proposed method.

stat.ML↗