Single chargino production via gluon-gluon fusion in a supersymmetric theory with an explicit R-parity violation

We studied the production of single chargino$\tilde{\chi}_1^{\pm}$ accompanied by $\mu^{\mp}$ lepton via gluon-gluon fusion at the LHC. The numerical analysis of their production rates is carried out in the mSUGRA scenario with some typical parameter sets. The results show that the cross sections of the $\tilde{\chi}_1^{\pm}\mu^{\mp}$ productions via gluon-gluon collision are in the order of $1 \sim 10^{2}$ femto barn quantitatively at the CERN LHC, and can be competitive with production mechanism via quark-antiquark annihilation process.Comment: LaTex file, 18 pages, 4 EPS file

Analyticity of the SRB measure of a lattice of coupled Anosov diffeomorphisms of the torus

We consider the "thermodynamic limit"of a d-dimensional lattice of hyperbolic dynamical systems on the 2-torus, interacting via weak and nearest neighbor coupling. We prove that the SRB measure is analytic in the strength of the coupling. The proof is based on symbolic dynamics techniques that allow us to map the SRB measure into a Gibbs measure for a spin system on a (d+1)-dimensional lattice. This Gibbs measure can be studied by an extension (decimation) of the usual "cluster expansion" techniques.Comment: 28 pages, 2 figure

Ranking Spaces for Predicting Human Movement in an Urban Environment

A city can be topologically represented as a connectivity graph, consisting of nodes representing individual spaces and links if the corresponding spaces are intersected. It turns out in the space syntax literature that some defined topological metrics can capture human movement rates in individual spaces. In other words, the topological metrics are significantly correlated to human movement rates, and individual spaces can be ranked by the metrics for predicting human movement. However, this correlation has never been well justified. In this paper, we study the same issue by applying the weighted PageRank algorithm to the connectivity graph or space-space topology for ranking the individual spaces, and find surprisingly that (1) the PageRank scores are better correlated to human movement rates than the space syntax metrics, and (2) the underlying space-space topology demonstrates small world and scale free properties. The findings provide a novel justification as to why space syntax, or topological analysis in general, can be used to predict human movement. We further conjecture that this kind of analysis is no more than predicting a drunkard's walking on a small world and scale free network. Keywords: Space syntax, topological analysis of networks, small world, scale free, human movement, and PageRankComment: 11 pages, 5 figures, and 2 tables, English corrections from version 1 to version 2, major changes in the section of introduction from version 2 to

Spatio-Temporal Sentiment Hotspot Detection Using Geotagged Photos

We perform spatio-temporal analysis of public sentiment using geotagged photo collections. We develop a deep learning-based classifier that predicts the emotion conveyed by an image. This allows us to associate sentiment with place. We perform spatial hotspot detection and show that different emotions have distinct spatial distributions that match expectations. We also perform temporal analysis using the capture time of the photos. Our spatio-temporal hotspot detection correctly identifies emerging concentrations of specific emotions and year-by-year analyses of select locations show there are strong temporal correlations between the predicted emotions and known events.Comment: To appear in ACM SIGSPATIAL 201

Exponential sum approximations for t−βt^{-\beta}

Given $\beta>0$ and $\delta>0$, the function $t^{-\beta}$ may be approximated for $t$ in a compact interval $[\delta,T]$ by a sum of terms of the form $we^{-at}$, with parameters $w>0$ and $a>0$. One such an approximation, studied by Beylkin and Monz\'on, is obtained by applying the trapezoidal rule to an integral representation of $t^{-\beta}$, after which Prony's method is applied to reduce the number of terms in the sum with essentially no loss of accuracy. We review this method, and then describe a similar approach based on an alternative integral representation. The main difference is that the new approach achieves much better results before the application of Prony's method; after applying Prony's method the performance of both is much the same.Comment: 18 pages, 5 figures. I have completely rewritten this paper because after uploading the previous version I realised that there is a much better approach. Note the change to the title. Have included minor corrections following revie

Chaos control in random Boolean networks by reducing mean damage percolation rate

Chaos control in Random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase. However, controlled nodes are only viewed as passive blocks to prevent perturbation spread. This paper proposes a new control method in which controlled nodes can exert an active impact on the network. Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions. Simulation results show that the number of nodes needed to achieve control is largely reduced compared to previous method. Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control.Comment: 10 pages, 2 figure