Electroweak phase transition in the economical 3-3-1 model

We consider the EWPT in the economical 3-3-1 (E331) model. Our analysis shows that the EWPT in the model is a sequence of two first-order phase transitions, $SU(3) \rightarrow SU(2)$ at the TeV scale and $SU(2) \rightarrow U(1)$ at the $100$ GeV scale. The EWPT $SU(3) \rightarrow SU(2)$ is triggered by the new bosons and the exotic quarks; its strength is about $1 - 13$ if the mass ranges of these new particles are $10^2 \,\mathrm{GeV} - 10^3 \,\mathrm{GeV}$. The EWPT $SU(2) \rightarrow U(1)$ is strengthened by only the new bosons; its strength is about $1 - 1.15$ if the mass parts of $H^0_1$, $H^\pm_2$ and $Y^\pm$ are in the ranges $10 \,\mathrm{GeV} - 10^2 \,\mathrm{GeV}$. The contributions of $H^0_1$ and $H^{\pm}_2$ to the strengths of both EWPTs may make them sufficiently strong to provide large deviations from thermal equilibrium and B violation necessary for baryogenesis.Comment: 17 pages, 9 figure

Random walks on mutual microRNA-target gene interaction network improve the prediction of disease-associated microRNAs

Background: MicroRNAs (miRNAs) have been shown to play an important role in pathological initiation, progression and maintenance. Because identification in the laboratory of disease-related miRNAs is not straightforward, numerous network-based methods have been developed to predict novel miRNAs in silico. Homogeneous networks (in which every node is a miRNA) based on the targets shared between miRNAs have been widely used to predict their role in disease phenotypes. Although such homogeneous networks can predict potential disease-associated miRNAs, they do not consider the roles of the target genes of the miRNAs. Here, we introduce a novel method based on a heterogeneous network that not only considers miRNAs but also the corresponding target genes in the network model. Results: Instead of constructing homogeneous miRNA networks, we built heterogeneous miRNA networks consisting of both miRNAs and their target genes, using databases of known miRNA-target gene interactions. In addition, as recent studies demonstrated reciprocal regulatory relations between miRNAs and their target genes, we considered these heterogeneous miRNA networks to be undirected, assuming mutual miRNA-target interactions. Next, we introduced a novel method (RWRMTN) operating on these mutual heterogeneous miRNA networks to rank candidate disease-related miRNAs using a random walk with restart (RWR) based algorithm. Using both known disease-associated miRNAs and their target genes as seed nodes, the method can identify additional miRNAs involved in the disease phenotype. Experiments indicated that RWRMTN outperformed two existing state-of-the-art methods: RWRMDA, a network-based method that also uses a RWR on homogeneous (rather than heterogeneous) miRNA networks, and RLSMDA, a machine learning-based method. Interestingly, we could relate this performance gain to the emergence of "disease modules" in the heterogeneous miRNA networks used as input for the algorithm. Moreover, we could demonstrate that RWRMTN is stable, performing well when using both experimentally validated and predicted miRNA-target gene interaction data for network construction. Finally, using RWRMTN, we identified 76 novel miRNAs associated with 23 disease phenotypes which were present in a recent database of known disease-miRNA associations. Conclusions: Summarizing, using random walks on mutual miRNA-target networks improves the prediction of novel disease-associated miRNAs because of the existence of "disease modules" in these networks

Retrieval of target structure information from laser-induced photoelectrons by few-cycle bicircular laser fields

Citation: Hoang, V. H., Le, V. H., Lin, C. D., & Le, A. T. (2017). Retrieval of target structure information from laser-induced photoelectrons by few-cycle bicircular laser fields. Physical Review A, 95(3), 6. doi:10.1103/PhysRevA.95.031402By analyzing theoretical results from a numerical solution of the time-dependent Schrodinger equation for atoms in few-cycle bicircular laser pulses, we show that high-energy photoelectron momentum spectra can be used to extract accurate elastic scattering differential cross sections of the target ion with free electrons. We find that the retrieval range for a scattering angle with bicircular pulses is wider than with linearly polarized pulses, although the retrieval method has to be modified to account for different returning directions of the electron in the continuum. This result can be used to extend the range of applicability of ultrafast imaging techniques such as laser-induced electron diffraction and for the accurate characterization of laser pulses

Constrained Representations of Map Graphs and Half-Squares

The square of a graph H, denoted H^2, is obtained from H by adding new edges between two distinct vertices whenever their distance in H is two. The half-squares of a bipartite graph B=(X,Y,E_B) are the subgraphs of B^2 induced by the color classes X and Y, B^2[X] and B^2[Y]. For a given graph G=(V,E_G), if G=B^2[V] for some bipartite graph B=(V,W,E_B), then B is a representation of G and W is the set of points in B. If in addition B is planar, then G is also called a map graph and B is a witness of G [Chen, Grigni, Papadimitriou. Map graphs. J. ACM49 (2) (2002) 127-138]. While Chen, Grigni, Papadimitriou proved that any map graph G=(V,E_G) has a witness with at most 3|V|-6 points, we show that, given a map graph G and an integer k, deciding if G admits a witness with at most k points is NP-complete. As a by-product, we obtain NP-completeness of edge clique partition on planar graphs; until this present paper, the complexity status of edge clique partition for planar graphs was previously unknown. We also consider half-squares of tree-convex bipartite graphs and prove the following complexity dichotomy: Given a graph G=(V,E_G) and an integer k, deciding if G=B^2[V] for some tree-convex bipartite graph B=(V,W,E_B) with |W|<=k points is NP-complete if G is non-chordal dually chordal and solvable in linear time otherwise. Our proof relies on a characterization of half-squares of tree-convex bipartite graphs, saying that these are precisely the chordal and dually chordal graphs