Searcharxiv⌕ Search

arXiv subjects

Hui Wang

Publications and source records attributed to Hui Wang.

At least 541 records · Page 30Linked to original sources
arXiv2011

Importance Sampling for Multiscale Diffusions

We construct importance sampling schemes for stochastic differential equations with small noise and fast oscillating coefficients. Standard Monte Carlo methods perform poorly for these problems in the small noise limit. With multiscale processes there are additional complications, and indeed the straightforward adaptation of methods for standard small noise diffusions will not produce efficient schemes. Using the subsolution approach we construct schemes and identify conditions under which the schemes will be asymptotically optimal. Examples and simulation results are provided.

math.PR↗
arXiv2011

An Infinite Swapping Approach to the Rare-Event Sampling Problem

We describe a new approach to the rare-event Monte Carlo sampling problem. This technique utilizes a symmetrization strategy to create probability distributions that are more highly connected and thus more easily sampled than their original, potentially sparse counterparts. After discussing the formal outline of the approach and devising techniques for its practical implementation, we illustrate the utility of the technique with a series of numerical applications to Lennard-Jones clusters of varying complexity and rare-event character.

cond-mat.stat-mech↗
arXiv2010

Local distortions in slow moving vortex lattices

We observed slow moving vortex lattices in NbSe_2 using a home built STM at a temperature of 4.2 K and magnetic fields in the range of 250-500 mT. The vortex lattices move coherently at speeds of 1-10 pm/s due to a slow decay of our magnetic field of 0.5 mT/day. We observe collective speed variations which indicate pinning/depinning events. Furthermore, we found -- to our knowledge for the first time -- small and local deviations from the coherent behavior. Most noticeable were local lattice distortions with displacements of the vortices of ~2 nm from their ideal lattice position. We compared the observations to a 2-D simulation of a vortex lattice moving under similar conditions and found similar distortion effects near pinning sites. Thus, studying the distortion patterns could lead to a better understanding of the vortex-defect interaction.

cond-mat.supr-con↗
arXiv2010

Hidden conformal symmetry of extreme and non-extreme Einstein-Maxwell-Dilaton-Axion black holes

The hidden conformal symmetry of extreme and non-extreme Einstein-Maxwell-Dilaton-Axion (EMDA) black holes is addressed in this paper. For the non-extreme one, employing the wave equation of massless scalars, the conformal symmetry with left temperature $T_{L}=\frac{M}{2πa}$ and right temperature $T_{R}=\frac{\sqrt{M^{2}-a^{2}}}{2πa}$ in the near region is found. The conformal symmetry is spontaneously broken due to the periodicity of the azimuthal angle. The microscopic entropy is derived by the Cardy formula and is fully in consistence with the Bekenstein-Hawking area-entropy law. The absorption cross section in the near region is calculated and exactly equals that in a 2D CFT. For the extreme case, by redefining the conformal coordinates, the duality between the solution space and CFT is studied. The microscopic entropy is found to exactly agree with the area-entropy law.

gr-qc↗
arXiv2010

Fourier-transfrom Ghost Imaging based on Compressive Sampling algorithm

A special algorithm for the Fourier-transform Ghost Imaging (GI) scheme is discussed based on the Compressive Sampling (CS) theory. The CS algorithm could also be used for the Fourier spectrum reconstruction of pure phase object by setting a proper sensing matrix. This could find its application in diffraction imaging of X-ray, neutron and electron with higher efficiency and resolution. Experiment results are also presented to prove the feasibility.

physics.optics↗
arXiv2009

Synchronization Analysis in Physical Layer Network Coding

Physical-layer Network Coding (PNC) makes use of the additive nature of the electromagnetic (EM) waves to apply network coding arithmetic at the physical layer. With PNC,the destructive effect of interference in wireless networks is eliminated and the capacity of networks can be boosted significantly. This paper addresses a key outstanding issue in PNC: synchronization among transmitting nodes. We first investigate the impact of imperfect synchronization (i.e., finite synchronization errors) in a 3-node network. It is shown that with QPSK modulation, PNC still yields significantly higher capacity than straightforward network coding when there are synchronization errors. Significantly, this remains to be so even in the extreme case when synchronization is not performed at all. Moving beyond a 3-node network, we propose and investigate a synchronization scheme for PNC in a general chain network. At last, numerical simulation verifies that PNC is robust to synchronization errors. In particular, for the mutual information performance, there is about 0.5dB loss without time synchronization and there is at most 2dB loss without phase synchronization.

cs.NI↗
arXiv2009

Fourier-transform Ghost Imaging for pure phase object based on Compressive Sampling algorithm

A special algorithm for the Fourier-transform Ghost Imaging (GI) scheme is discussed based on the Compressive Sampling (CS) theory. Though developed mostly in real space, CS algorithm could also be used for the Fourier spectrum reconstruction of pure phase object by setting a proper sensing matrix. This could find its application in diffraction imaging of X-ray, neutron and electron with higher efficiency and resolution. Simulation and experiment results are also presented to prove the feasibility.

quant-ph↗
arXiv2009

A Fault-tolerant Structure for Reliable Multi-core Systems Based on Hardware-Software Co-design

To cope with the soft errors and make full use of the multi-core system, this paper gives an efficient fault-tolerant hardware and software co-designed architecture for multi-core systems. And with a not large number of test patterns, it will use less than 33% hardware resources compared with the traditional hardware redundancy (TMR) and it will take less than 50% time compared with the traditional software redundancy (time redundant).Therefore, it will be a good choice for the fault-tolerant architecture for the future high-reliable multi-core systems.

cs.AR↗
arXiv2009

Interference with Symbol-misalignment

This paper studies the impact of interference asynchrony among different links in a wireless network. Without deliberate coordination and cooperation among the active links, there is a naturally occurring misalignment between the symbols of the targeted signal of a receiver and the symbols of the interfering signals. Interestingly, we show that the interference asynchrony can actually improve the BER performance, compared with the situation in which symbols of al signals ay aligned. In particular, we show that symbol misalignment can decrease the "effective interference power" and change the distribution of the interfering signals, in a way that results in lower BER. To ensure that symbol misalignment can be consistently attained, we propose two simple schemes that introduce time-varying symbol offsets to obtain an "average" performance of random symbol misalignment. Notably, our schemes do not change the simple receiver design structure; only the transmitters are modified in a minor way.

cs.NI↗
arXiv2009

Ghost imaging without beam splitter

Many significant results have been achieved in the fields of ghost imaging, in which the beam splitter is an indispensable optical component. This paper introduces a method to realize ghost imaging without beam splitter. And we study this method experimentally and theoretically. Finally, we suggest that our device can be applied to implement the ghost imaging when we use the Sun light as the light source.

physics.optics↗
arXiv2009

A versatile simulation of slow moving vortex lattices

We designed and implemented our own versatile simulation software in order to understand the velocity changes and track patterns observed in slow moving vortex lattices. The data was obtained from time series of STM images on NbSe$_2$ in a magnetic field range of 250-750 mT. The main thrust is to explore possible driving mechanism and to test the effect of various defect configuration on vortex velocity and tracks. The simulation uses the full vortex--vortex and vortex--defect interaction. It allows for periodic boundary conditions as well as a repulsive sample edge. In early versions the time intervals for recalculating the force were estimated for individual vortices. This, however, led to a positional 'noise' of unacceptable temperature of the vortex lattice and was hence replaced by a global time step control. We were able to produce similar track and velocity patterns as well as local lattice distortions near point defects as observed by STM. A detailed analysis is, however, beyond the scope of this paper.

physics.comp-ph↗
arXiv2008

Self-organized periodicity of protein clusters in growing bacteria

Chemotaxis receptors in E. coli form clusters at the cell poles and also laterally along the cell body, and this clustering plays an important role in signal transduction. Recently, experiments using flourrescence imaging have shown that, during cell growth, lateral clusters form at positions approximately periodically spaced along the cell body. In this paper, we demonstrate within a lattice model that such spatial organization could arise spontaneously from a stochastic nucleation mechanism. The same mechanism may explain the recent observation of periodic aggregates of misfolded proteins in E. coli.

cond-mat.stat-mech↗
arXiv2008

Network Quotients: Structural Skeletons of Complex Systems

A defining feature of many large empirical networks is their intrinsic complexity. However, many networks also contain a large degree of structural repetition. An immediate question then arises: can we characterize essential network complexity while excluding structural redundancy? In this article we utilize inherent network symmetry to collapse all redundant information from a network, resulting in a coarse-graining which we show to carry the essential structural information of the `parent' network. In the context of algebraic combinatorics, this coarse-graining is known as the \emph{quotient}. We systematically explore the theoretical properties of network quotients and summarize key statistics of a variety of `real-world' quotients with respect to those of their parent networks. In particular, we find that quotients can be substantially smaller than their parent networks yet typically preserve various key functional properties such as complexity (heterogeneity and hubs vertices) and communication (diameter and mean geodesic distance), suggesting that quotients constitute the essential structural skeleton of their parent network. We summarize with a discussion of potential uses of quotients in analysis of biological regulatory networks and ways in which using quotients can reduce the computational complexity of network algorithms.

physics.soc-ph↗
arXiv2007

Dynamic importance sampling for queueing networks

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network setting (e.g., a two-node tandem network). Exploiting connections between importance sampling, differential games, and classical subsolutions of the corresponding Isaacs equation, we show how to design and analyze simple and efficient dynamic importance sampling schemes for general classes of networks. The models used to illustrate the approach include $d$-node tandem Jackson networks and a two-node network with feedback, and the rare events studied are those of large queueing backlogs, including total population overflow and the overflow of individual buffers.

math.PR↗
arXiv2007

Symmetry based Structure Entropy of Complex Networks

Precisely quantifying the heterogeneity or disorder of a network system is very important and desired in studies of behavior and function of the network system. Although many degree-based entropies have been proposed to measure the heterogeneity of real networks, heterogeneity implicated in the structure of networks can not be precisely quantified yet. Hence, we propose a new structure entropy based on automorphism partition to precisely quantify the structural heterogeneity of networks. Analysis of extreme cases shows that entropy based on automorphism partition can quantify the structural heterogeneity of networks more precisely than degree-based entropy. We also summarized symmetry and heterogeneity statistics of many real networks, finding that real networks are indeed more heterogenous in the view of automorphism partition than what have been depicted under the measurement of degree based entropies; and that structural heterogeneity is strongly negatively correlated to symmetry of real networks.

physics.soc-ph↗
arXiv2007

Emergence of Symmetry in Complex Networks

Many real networks have been found to have a rich degree of symmetry, which is a very important structural property of complex network, yet has been rarely studied so far. And where does symmetry comes from has not been explained. To explore the mechanism underlying symmetry of the networks, we studied statistics of certain local symmetric motifs, such as symmetric bicliques and generalized symmetric bicliques, which contribute to local symmetry of networks. We found that symmetry of complex networks is a consequence of similar linkage pattern, which means that nodes with similar degree tend to share similar linkage targets. A improved version of BA model integrating similar linkage pattern successfully reproduces the symmetry of real networks, indicating that similar linkage pattern is the underlying ingredient that responsible for the emergence of the symmetry in complex networks.

physics.soc-ph↗
arXiv2007

Approaching equilibrium and the distribution of clusters

We investigate the approach to stable and metastable equilibrium in Ising models using a cluster representation. The distribution of nucleation times is determined using the Metropolis algorithm and the corresponding $ϕ^{4}$ model using Langevin dynamics. We find that the nucleation rate is suppressed at early times even after global variables such as the magnetization and energy have apparently reached their time independent values. The mean number of clusters whose size is comparable to the size of the nucleating droplet becomes time independent at about the same time that the nucleation rate reaches its constant value. We also find subtle structural differences between the nucleating droplets formed before and after apparent metastable equilibrium has been established.

cond-mat.stat-mech↗