arXiv subjects

Huijuan Wang

Publications and source records attributed to Huijuan Wang.

53 records · Page 3Linked to original sources

arXiv2018

Investigating the Efficiency of the Beijing Faint Object Spectrograph and Camera (BFOSC) of the Xinglong 2.16-m Reflector

The Beijing Faint Object Spectrograph and Camera (BFOSC) is one of the most important instruments of the 2.16-m telescope of the Xinglong Observatory. Every year there are ~ 20 SCI-papers published based on the observational data of this telescope. In this work, we have systemically measured the total efficiency of the BFOSC of the 2.16-m reflector, based on the observations of two ESO flux standard stars. We have obtained the total efficiencies of the BFOSC instrument of different grisms with various slit widths in almost all ranges, and analysed the factors which effect the efficiency of telescope and spectrograph. For the astronomical observers, the result will be useful for them to select a suitable slit width, depending on their scientific goals and weather conditions during the observation; For the technicians, the result will help them systemically find out the real efficiency of telescope and spectrograph, and further to improve the total efficiency and observing capacity of the telescope technically.

astro-ph.IM↗

arXiv2018

Information diffusion backbones in temporal networks

Much effort has been devoted to understand how temporal network features and the choice of the source node affect the prevalence of a diffusion process. In this work, we addressed the further question: node pairs with what kind of local and temporal connection features tend to appear in a diffusion trajectory or path, thus contribute to the actual information diffusion. We consider the Susceptible-Infected spreading process with a given infection probability per contact on a large number of real-world temporal networks. We illustrate how to construct the information diffusion backbone where the weight of each link tells the probability that a node pair appears in a diffusion process starting from a random node. We unravel how these backbones corresponding to different infection probabilities relate to each other and point out the importance of two extreme backbones: the backbone with infection probability one and the integrated network, between which other backbones vary. We find that the temporal node pair feature that we proposed could better predict the links in the extreme backbone with infection probability one as well as the high weight links than the features derived from the integrated network. This universal finding across all the empirical networks highlights that temporal information are crucial in determining a node pair's role in a diffusion process. A node pair with many early contacts tends to appear in a diffusion process. Our findings shed lights on the in-depth understanding and may inspire the control of information spread.

physics.soc-ph↗

arXiv2017

Modeling of Information Diffusion on Social Networks with Applications to WeChat

Traces of user activities recorded in online social networks such as the creation, viewing and forwarding/sharing of information over time open new possibilities to quantitatively and systematically understand the information diffusion process on social networks. From an online social network like WeChat, we could collect a large number of information cascade trees, each of which tells the spreading trajectory of a message/information such as which user creates the information and which users view or forward the information shared by which neighbors. In this work, we propose two heterogeneous non-linear models. Both models are validated by the WeChat data in reproducing and explaining key features of cascade trees. Specifically, we firstly apply the Random Recursive Tree (RRT) to model the cascade tree topologies, capturing key features, i.e. the average path length and degree variance of a cascade tree in relation to the number of nodes (size) of the tree. The RRT model with a single parameter $θ$ describes the growth mechanism of a tree, where a node in the existing tree has a probability $d_i^θ$ of being connected to a newly added node that depends on the degree $d_i$ of the existing node. The identified parameter $θ$ quantifies the relative depth or broadness of the cascade trees, indicating that information propagates via a star-like broadcasting or viral-like hop by hop spreading. The RRT model explains the appearance of hubs, thus a possibly smaller average path length as the cascade size increases, as observed in WeChat. We further propose the stochastic Susceptible View Forward Removed (SVFR) model to depict the dynamic user behaviors including creating, viewing, forwarding and ignoring a message on a given social network.

cs.SI↗

arXiv2016

Resilience of epidemics on networks

Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations, and may bounce back to its original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ${λ_{2}}$ during SIS (susceptible-infected-susceptible) epidemic propagation to model perturbations (control state), whereas the infection rate is ${λ_{1}}$ in the rest of time. Through simulations and theoretical analysis, we find that even for ${λ_{2}<λ_{c}}$, epidemics eventually could bounce back if control duration is below a threshold. This critical control time for epidemic resilience, i.e., ${cd_{max}}$ can be predicted by the diameter (${d}$) of the underlying network, with the quantitative relation ${cd_{max}\sim d^α}$. Our findings can help to design a better mitigation strategy for epidemics.

physics.soc-ph↗

arXiv2016

The Accuracy of Mean-Field Approximation for Susceptible-Infected-Susceptible Epidemic Spreading

The epidemic spreading has been studied for years by applying the mean-field approach in both homogeneous case, where each node may get infected by an infected neighbor with the same rate, and heterogeneous case, where the infection rates between different pairs of nodes are different. Researchers have discussed whether the mean-field approaches could accurately describe the epidemic spreading for the homogeneous cases but not for the heterogeneous cases. In this paper, we explore under what conditions the mean-field approach could perform well when the infection rates are heterogeneous. In particular, we employ the Susceptible-Infected-Susceptible (SIS) model and compare the average fraction of infected nodes in the metastable state obtained by the continuous-time simulation and the mean-field approximation. We concentrate on an individual-based mean-field approximation called the N-intertwined Mean Field Approximation (NIMFA), which is an advanced approach considered the underlying network topology. Moreover, we consider not only the independent and identically distributed (i.i.d.) infection rate but also the infection rate correlated with the degree of the two end nodes. We conclude that NIMFA is generally more accurate when the prevalence of the epidemic is higher. Given the same effective infection rate, NIMFA is less accurate when the variance of the i.i.d.\ infection rate or the correlation between the infection rate and the nodal degree leads to a lower prevalence. Moreover, given the same actual prevalence, NIMFA performs better in the cases: 1) when the variance of the i.i.d.\ infection rates is smaller (while the average is unchanged); 2) when the correlation between the infection rate and the nodal degree is positive.

physics.soc-ph↗

arXiv2016

SIS Epidemic Spreading with Correlated Heterogeneous Infection Rates

The epidemic spreading has been widely studied when each node may get infected by an infected neighbor with the same rate. However, the infection rate between a pair of nodes is usually heterogeneous and even correlated with their nodal degrees in the contact network. We aim to understand how such correlated heterogeneous infection rates influence the spreading on different network topologies. Motivated by real-world datasets, we propose a correlated heterogeneous Susceptible-Infected-Susceptible model which assumes that the infection rate $β_{ij}(=β_{ji})$ between node $i$ and $j$ is correlated with the degree of the two end nodes: $β_{ij}=c(d_id_j)^α$, where $α$ indicates the strength of the correlation and $c$ is selected so that the average infection rate is $1$. In order to understand the effect of such correlation on epidemic spreading, we consider as well the corresponding uncorrected but still heterogeneous infection rate scenario as a reference, where the original correlated infection rates in our CSIS model are shuffled and reallocated to the links of the same network topology. We compare these two scenarios in the average fraction of infected nodes in the metastable state on Erd{ö}s-R{é}nyi (ER) and scale-free (SF) networks with a similar average degree. Through the continuous-time simulations, we find that, when the recovery rate is small, the negative correlation is more likely to help the epidemic spread and the positive correlation prohibit the spreading; as the recovery rate increases to be larger than a critical value, the positive but not negative correlation tends to help the spreading. Our findings are further analytically proved in a wheel network (one central node connects with each of the nodes in a ring) and validated on real-world networks with correlated heterogeneous interaction frequencies.

physics.soc-ph↗

arXiv2016

The Xinglong 2.16-m Telescope: Current Instruments and Scientific Projects

The Xinglong 2.16-m reflector is the first 2-meter class astronomical telescope in China. It was jointly designed and built by the Nanjing Astronomical Instruments Factory (NAIF), Beijing Astronomical Observatory (now National Astronomical Observatories, Chinese Academy of Sciences, NAOC) and Institute of Automation, Chinese Academy of Sciences in 1989. It is Ritchey-Chrétien (R-C) reflector on an English equatorial mount and the effective aperture is 2.16 meters. It had been the largest optical telescope in China for $\sim18$ years until the Guoshoujing Telescope (also called Large Sky Area Multi-Object Fiber Spectroscopic Telescope, LAMOST) and the Lijiang 2.4-m telescope were built. At present, there are three main instruments on the Cassegrain focus available: the Beijing Faint Object Spectrograph and Camera (BFOSC) for direct imaging and low resolution ($R\sim500-2000$) spectroscopy, the spectrograph made by Optomechanics Research Inc. (OMR) for low resolution spectroscopy (the spectral resolutions are similar to those of BFOSC) and the fiber-fed High Resolution Spectrograph (HRS, $R\sim30000-65000$). The telescope is widely open to astronomers all over China as well as international astronomical observers. Each year there are more than 40 ongoing observing projects, including 6-8 key projects. Recently, some new techniques and instruments (e.g., astro-frequency comb calibration system, polarimeter and adaptive optics) have been or will be tested on the telescope to extend its observing abilities.

astro-ph.IM↗

arXiv2016

SIS Epidemic Spreading with Heterogeneous Infection Rates

In this work, we aim to understand the influence of the heterogeneity of infection rates on the Susceptible-Infected-Susceptible (SIS) epidemic spreading. Employing the classic SIS model as the benchmark, we study the influence of the independently identically distributed infection rates on the average fraction of infected nodes in the metastable state. The log-normal, gamma and a newly designed distributions are considered for infection rates. We find that, when the recovery rate is small, i.e.\ the epidemic spreads out in both homogeneous and heterogeneous cases: 1) the heterogeneity of infection rates on average retards the virus spreading, and 2) a larger even-order moment of the infection rates leads to a smaller average fraction of infected nodes, but the odd-order moments contribute in the opposite way; when the recovery rate is large, i.e.\ the epidemic may die out or infect a small fraction of the population, the heterogeneity of infection rates may enhance the probability that the epidemic spreads out. Finally, we verify our conclusions via real-world networks with their heterogeneous infection rates. Our results suggest that, in reality the epidemic spread may not be so severe as the classic SIS model indicates, but to eliminate the epidemic is probably more difficult.

physics.soc-ph↗

arXiv2015

Decentralized Protection Strategies against SIS Epidemics in Networks

Defining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a SIS epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework and find pure, mixed equilibria, and the Price of Anarchy (PoA) in several network topologies. Further, we propose both a decentralized algorithm and an iterative procedure to compute a pure equilibrium in the general case of a multiple communities network. Finally, we evaluate the algorithms and give numerical illustrations of all our results.

eess.SY↗

arXiv2014

Correlation between centrality metrics and their application to the opinion model

In recent decades, a number of centrality metrics describing network properties of nodes have been proposed to rank the importance of nodes. In order to understand the correlations between centrality metrics and to approximate a high-complexity centrality metric by a strongly correlated low-complexity metric, we first study the correlation between centrality metrics in terms of their Pearson correlation coefficient and their similarity in ranking of nodes. In addition to considering the widely used centrality metrics, we introduce a new centrality measure, the degree mass. The m order degree mass of a node is the sum of the weighted degree of the node and its neighbors no further than m hops away. We find that the B_{n}, the closeness, and the components of x_{1} are strongly correlated with the degree, the 1st-order degree mass and the 2nd-order degree mass, respectively, in both network models and real-world networks. We then theoretically prove that the Pearson correlation coefficient between x_{1} and the 2nd-order degree mass is larger than that between x_{1} and a lower order degree mass. Finally, we investigate the effect of the inflexible antagonists selected based on different centrality metrics in helping one opinion to compete with another in the inflexible antagonists opinion model. Interestingly, we find that selecting the inflexible antagonists based on the leverage, the B_{n}, or the degree is more effective in opinion-competition than using other centrality metrics in all types of networks. This observation is supported by our previous observations, i.e., that there is a strong linear correlation between the degree and the B_{n}, as well as a high centrality similarity between the leverage and the degree.

physics.soc-ph↗

arXiv2014

Heterogeneous Recovery Rates against SIS Epidemics in Directed Networks

The nodes in communication networks are possibly and most likely equipped with different recovery resources, which allow them to recover from a virus with different rates. In this paper, we aim to understand know how to allocate the limited recovery resources to efficiently prevent the spreading of epidemics. We study the susceptible-infected-susceptible (SIS) epidemic model on directed scale-free networks. In the classic SIS model, a susceptible node can be infected by an infected neighbor with the infection rate $β$ and an infected node can be recovered to be susceptible again with the recovery rate $δ$. In the steady state a fraction $y_\infty$ of nodes are infected, which shows how severely the network is infected. We propose to allocate the recovery rate $δ_i$ for node $i$ according to its indegree and outdegree-$δ_i\scriptsize{\sim}k_{i,in}^{α_{in}}k_{i,out}^{α_{out}}$, given the finite average recovery rate $\langleδ\rangle$ representing the limited recovery resources over the whole network. We find that, by tuning the two scaling exponents $α_{in}$ and $α_{out}$, we can always reduce the infection fraction $y_\infty$ thus reducing the extent of infections, comparing to the homogeneous recovery rates allocation. Moreover, we can find our optimal strategy via the optimal choice of the exponent $α_{in}$ and $α_{out}$. Our optimal strategy indicates that when the recovery resources are sufficient, more resources should be allocated to the nodes with a larger indegree or outdegree, but when the recovery resource is very limited, only the nodes with a larger outdegree should be equipped with more resources. We also find that our optimal strategy works better when the recovery resources are sufficient but not yet able to make the epidemic die out, and when the indegree outdegree correlation is small.

physics.soc-ph↗

arXiv2014

Non-consensus opinion model on directed networks

Dynamic social opinion models have been widely studied on undirected networks, and most of them are based on spin interaction models that produce a consensus. In reality, however, many networks such as Twitter and the World Wide Web are directed and are composed of both unidirectional and bidirectional links. Moreover, from choosing a coffee brand to deciding who to vote for in an election, two or more competing opinions often coexist. In response to this ubiquity of directed networks and the coexistence of two or more opinions in decision-making situations, we study a non-consensus opinion model introduced by Shao et al. \cite{shao2009dynamic} on directed networks. We define directionality $ξ$ as the percentage of unidirectional links in a network, and we use the linear correlation coefficient $ρ$ between the indegree and outdegree of a node to quantify the relation between the indegree and outdegree. We introduce two degree-preserving rewiring approaches which allow us to construct directed networks that can have a broad range of possible combinations of directionality $ξ$ and linear correlation coefficient $ρ$ and to study how $ξ$ and $ρ$ impact opinion competitions. We find that, as the directionality $ξ$ or the indegree and outdegree correlation $ρ$ increases, the majority opinion becomes more dominant and the minority opinion's ability to survive is lowered.

physics.soc-ph↗

arXiv2013

Epidemic threshold in directed networks

Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the social network Twitter and the WWW networks, upon which information, emotion or malware spreads, are shown to be directed networks, composed of both unidirectional links and bidirectional links. We define the directionality as the percentage of unidirectional links. The epidemic threshold for the susceptible-infected-susceptible (SIS) epidemic has been proved to be 1/lambda_{1} in directed networks by N-intertwined Mean-field Approximation, where lambda_{1}, also called as spectral radius, is the largest eigenvalue of the adjacency matrix. Here, we propose two algorithms to generate directed networks with a given degree distribution, where the directionality can be controlled. The effect of directionality on the spectral radius lambda_{1}, principal eigenvector x_{1}, spectral gap lambda_{1}-|lambda_{2}|) and algebraic connectivity |mu_{N-1}| is studied. Important findings are that the spectral radius lambda_{1} decreases with the directionality, and the spectral gap and the algebraic connectivity increase with the directionality. The extent of the decrease of the spectral radius depends on both the degree distribution and the degree-degree correlation rho_{D}. Hence, the epidemic threshold of directed networks is larger than that of undirected networks, and a random walk converges to its steady-state faster in directed networks than in undirected networks with degree distribution.

physics.soc-ph↗

arXiv2013

Effect of the Interconnected Network Structure on the Epidemic Threshold

Most real-world networks are not isolated. In order to function fully, they are interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, the dynamics of the spread within each species (the contact network) differs from that of the spread between the two species (the interconnected network). We model two generic interconnected networks using two adjacency matrices, A and B, in which A is a 2N*2N matrix that depicts the connectivity within each of two networks of size N, and B a 2N*2N matrix that depicts the interconnections between the two. Using an N-intertwined mean-field approximation, we determine that a critical susceptable-infected-susceptable (SIS) epidemic threshold in two interconnected networks is 1/λ1(A+αB), where the infection rate is βwithin each of the two individual networks and αβin the interconnected links between the two networks and λ1(A+αB) is the largest eigenvalue of the matrix A+αB. In order to determine how the epidemic threshold is dependent upon the structure of interconnected networks, we analytically derive λ1(A+αB) using perturbation approximation for small and large α, the lower and upper bound for any αas a function of the adjacency matrix of the two individual networks, and the interconnections between the two and their largest eigenvalues/eigenvectors. We verify these approximation and boundary values for λ1(A+αB) using numerical simulations, and determine how component network features affect λ1(A+αB).

physics.soc-ph↗

arXiv2012

The robustness of interdependent clustered networks

It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. {\bf 103}, 058701 (2009)], we develop an analytical method for studying how clustering within the networks of a system of interdependent networks affects the system's robustness. We find that clustering significantly increases the vulnerability of the system, which is represented by the increased value of the percolation threshold $p_c$ in interdependent networks.

physics.soc-ph↗

arXiv2012

Non-consensus opinion models on complex networks

We focus on non-consensus opinion models in which above a certain threshold two opinions coexist in a stable relationship. We revisit and extend the non-consensus opinion (NCO) model introduced by Shao. We generalize the NCO model by adding a weight factor W to individual's own opinion when determining its future opinion (NCOW model). We find that as W increases the minority opinion holders tend to form stable clusters with a smaller initial minority fraction compared to the NCO model. We also revisit another non-consensus opinion, the inflexible contrarian opinion (ICO) model, which introduces inflexible contrarians to model a competition between two opinions in the steady state. In the ICO model, the inflexible contrarians effectively decrease the size of the largest cluster of the rival opinion. All of the above models have previously been explored in terms of a single network. However opinions propagate not only within single networks but also between networks, we study here the opinion dynamics in coupled networks. We apply the NCO rule on each individual network and the global majority rule on interdependent pairs. We find that the interdependent links effectively force the system from a second order phase transition, which is characteristic of the NCO model on a single network, to a hybrid phase transition, i.e., a mix of second-order and abrupt jump-like transitions that ultimately becomes, as we increase the percentage of interdependent agents, a pure abrupt transition. We conclude that for the NCO model on coupled networks, interactions through interdependent links could push the non-consensus opinion type model to a consensus opinion type model, which mimics the reality that increased mass communication causes people to hold opinions that are increasingly similar.

physics.soc-ph↗

arXiv2011

Competition of spatial and temporal instabilities under time delay near codimension-two Turing-Hopf bifurcations

Competition of spatial and temporal instabilities under time delay near the codimension-two Turing-Hopf bifurcations is studied in a reaction-diffusion equation. The time delay changes remarkably the oscillation frequency, the intrinsic wave vector, and the intensities of both Turing and Hopf modes. The application of appropriate time delay can control the competition between the Turing and Hopf modes. Analysis shows that individual or both feedbacks can realize the control of the transformation between the Turing and Hopf patterns. Two dimensional numerical simulations validate the analytical results.

nlin.PS↗