19,804 research outputs found

    Longitudinal/Goldstone boson equivalence and phenomenology of probing the electroweak symmetry breaking

    Get PDF
    We formulate the equivalence between the longitudinal weak-boson and the Goldstone boson as a criterion for sensitively probing the electroweak symmetry breaking mechanism and develop a precise power counting rule for chiral Lagrangian formulated electroweak theories. With these we semi-quatitatively analyze the sensitivities to various effective operators related to electrowaeak symmetry breaking via weak-boson scatterings at the CERN Large Hadron Collider (LHC).Comment: 6 pages, LaTex, 1 postscript figure included using psfig.te

    Sensitivity of the LHC to Electroweak Symmetry Breaking: Equivalence Theorem as a Criterion

    Get PDF
    Based upon our recent study on the intrinsic connection between the longitudinal weak-boson scatterings and probing the electroweak symmetry breaking (EWSB) mechanism, we reveal the profound physical content of the Equivalence Theorem (ET) as being able to discriminate physical processes which are sensitive/insensitive to probing the EWSB sector. With this physical content of the ET as a criterion, we analyze the complete set of the bosonic operators in the electroweak chiral Lagrangian and systematically classify the sensitivities to probing all these operators at the CERN LHC via the weak-boson fusion in W±W±W^\pm W^\pm channel. This is achieved by developing a precise power counting rule (a generalization from Weinberg's counting method) to {\it separately} count the power dependences on the energy EE and all relevant mass scales.Comment: 33 pages, LaTeX, 10 figures and Table-1b are in the separate file figtab.uu. (The only change made from the previous version is to fix the bugs in the uuencoded file.

    Efficient calculation of the robustness measure R for complex networks

    Get PDF
    In a recent work, Schneider et al. (2011) proposed a new measure R for network robustness, where the value of R is calculated within the entire process of malicious node attacks. In this paper, we present an approach to improve the calculation efficiency of R, in which a computationally efficient robustness measure R' is introduced when the fraction of failed nodes reaches to a critical threshold qc. Simulation results on three different types of network models and three real networks show that these networks all exhibit a computationally efficient robustness measure R'. The relationships between R' and the network size N and the network average degree are also explored. It is found that the value of R' decreases with N while increases with . Our results would be useful for improving the calculation efficiency of network robustness measure R for complex networks.Peer ReviewedPostprint (author's final draft
    • …
    corecore