The topology of a discussion: the #occupy case

We analyse a large sample of the Twitter activity developed around the social movement 'Occupy Wall Street' to study the complex interactions between the human communication activity and the semantic content of a discussion. We use a network approach based on the analysis of the bipartite graph @Users-#Hashtags and of its projections: the 'semantic network', whose nodes are hashtags, and the 'users interest network', whose nodes are users In the first instance, we find out that discussion topics (#hashtags) present a high heterogeneity, with the distinct role of the communication hubs where most the 'opinion traffic' passes through. In the second case, the self-organization process of users activity leads to the emergence of two classes of communicators: the 'professionals' and the 'amateurs'. Moreover the network presents a strong community structure, based on the differentiation of the semantic topics, and a high level of structural robustness when a certain set of topics are censored and/or accounts are removed. Analysing the characteristics the @Users-#Hashtags network we can distinguish three phases of the discussion about the movement. Each phase corresponds to specific moment of the movement: from declaration of intent, organisation and development and the final phase of political reactions. Each phase is characterised by the presence of specific #hashtags in the discussion. Keywords: Twitter, Network analysisComment: 13 pages, 9 figure

Metapopulation epidemic models with heterogeneous mixing and travel behaviour.

BACKGROUND: Determining the pandemic potential of an emerging infectious disease and how it depends on the various epidemic and population aspects is critical for the preparation of an adequate response aimed at its control. The complex interplay between population movements in space and non-homogeneous mixing patterns have so far hindered the fundamental understanding of the conditions for spatial invasion through a general theoretical framework. To address this issue, we present an analytical modelling approach taking into account such interplay under general conditions of mobility and interactions, in the simplifying assumption of two population classes. METHODS: We describe a spatially structured population with non-homogeneous mixing and travel behaviour through a multi-host stochastic epidemic metapopulation model. Different population partitions, mixing patterns and mobility structures are considered, along with a specific application for the study of the role of age partition in the early spread of the 2009 H1N1 pandemic influenza. RESULTS: We provide a complete mathematical formulation of the model and derive a semi-analytical expression of the threshold condition for global invasion of an emerging infectious disease in the metapopulation system. A rich solution space is found that depends on the social partition of the population, the pattern of contacts across groups and their relative social activity, the travel attitude of each class, and the topological and traffic features of the mobility network. Reducing the activity of the less social group and reducing the cross-group mixing are predicted to be the most efficient strategies for controlling the pandemic potential in the case the less active group constitutes the majority of travellers. If instead traveling is dominated by the more social class, our model predicts the existence of an optimal across-groups mixing that maximises the pandemic potential of the disease, whereas the impact of variations in the activity of each group is less important. CONCLUSIONS: The proposed modelling approach introduces a theoretical framework for the study of infectious diseases spread in a population with two layers of heterogeneity relevant for the local transmission and the spatial propagation of the disease. It can be used for pandemic preparedness studies to identify adequate interventions and quantitatively estimate the corresponding required effort, as well as in an emerging epidemic situation to assess the pandemic potential of the pathogen from population and early outbreak data

Grover's algorithm on a Feynman computer

We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin-spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our model implements the idea of "timing" a quantum algorithm using a continuous-time random walk. In this context we examine some consequences of the entanglement between the states of the input/output register and the states of the quantum clock

Speed and entropy of an interacting continuous time quantum walk

We present some dynamic and entropic considerations about the evolution of a continuous time quantum walk implementing the clock of an autonomous machine. On a simple model, we study in quite explicit terms the Lindblad evolution of the clocked subsystem, relating the evolution of its entropy to the spreading of the wave packet of the clock. We explore possible ways of reducing the generation of entropy in the clocked subsystem, as it amounts to a deficit in the probability of finding the target state of the computation. We are thus lead to examine the benefits of abandoning some classical prejudice about how a clocking mechanism should operate.Comment: 25 pages, 14 figure

Protein methylation is required to maintain optimal HIV-1 infectivity

BACKGROUND: Protein methylation is recognized as a major protein modification pathway regulating diverse cellular events such as protein trafficking, transcription, and signal transduction. More recently, protein arginine methyltransferase activity has been shown to regulate HIV-1 transcription via Tat. In this study, adenosine periodate (AdOx) was used to globally inhibit protein methyltransferase activity so that the effect of protein methylation on HIV-1 infectivity could be assessed. RESULTS: Two cell culture models were used: HIV-1-infected CEM T-cells and HEK293T cells transfected with a proviral DNA plasmid. In both models, AdOx treatment of cells increased the levels of virion in culture supernatant. However, these viruses had increased levels of unprocessed or partially processed Gag-Pol, significantly increased diameter, and displayed reduced infectivity in a MAGI X4 assay. AdOx reduced infectivity equally in both dividing and non-dividing cells. However, infectivity was further reduced if Vpr was deleted suggesting virion proteins, other than Vpr, were affected by protein methylation. Endogenous reverse transcription was not inhibited in AdOx-treated HIV-1, and infectivity could be restored by pseudotyping HIV with VSV-G envelope protein. These experiments suggest that AdOx affects an early event between receptor binding and uncoating, but not reverse transcription. CONCLUSION: Overall, we have shown for the first time that protein methylation contributes towards maximal virus infectivity. Furthermore, our results also indicate that protein methylation regulates HIV-1 infectivity in a complex manner most likely involving the methylation of multiple viral or cellular proteins and/or multiple steps of replication

Some Thoughts About Appealing Directions for the Future of Fuzzy Theory and Technologies Along the Path Traced by Lotfi Zadeh

The quoted text is an interesting instance of a fuzzy object: it is currently known in slightly diversified forms, each rather different from the quoted one, which corresponds to the first known appearance in English of this adage

Quantum Annealing and Analog Quantum Computation

We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of such computationally hard problems to the classical spin glass problems. The quantum spin glass problems arise with the introduction of quantum fluctuations, and the annealing behavior of the systems as these fluctuations are reduced slowly to zero. This provides a general framework for realizing analog quantum computation.Comment: 22 pages, 7 figs (color online); new References Added. Reviews of Modern Physics (in press

The power of quantum systems on a line

We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with 9 states per particle). This might have practical implications for experimentalists interested in constructing an adiabatic quantum computer. Building on the same construction, but with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete; QMA is a quantum analogue of NP. This is in striking contrast to the fact that the analogous classical problem, namely, one-dimensional MAX-2-SAT with nearest neighbor constraints, is in P. The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Not all illegal configurations can be ruled out by local checks, so instead we rule out such illegal configurations because they would, in the future, evolve into a state which can be seen locally to be illegal. Our construction implies (assuming the quantum Church-Turing thesis and that quantum computers cannot efficiently solve QMA-complete problems) that there are one-dimensional systems which take an exponential time to relax to their ground states at any temperature, making them candidates for being one-dimensional spin glasses.Comment: 21 pages. v2 has numerous corrections and clarifications, and most importantly a new author, merged from arXiv:0705.4067. v3 is the published version, with additional clarifications, publisher's version available at http://www.springerlink.co

Non-intersecting Brownian walkers and Yang-Mills theory on the sphere

We study a system of N non-intersecting Brownian motions on a line segment [0,L] with periodic, absorbing and reflecting boundary conditions. We show that the normalized reunion probabilities of these Brownian motions in the three models can be mapped to the partition function of two-dimensional continuum Yang-Mills theory on a sphere respectively with gauge groups U(N), Sp(2N) and SO(2N). Consequently, we show that in each of these Brownian motion models, as one varies the system size L, a third order phase transition occurs at a critical value L=L_c(N)\sim \sqrt{N} in the large N limit. Close to the critical point, the reunion probability, properly centered and scaled, is identical to the Tracy-Widom distribution describing the probability distribution of the largest eigenvalue of a random matrix. For the periodic case we obtain the Tracy-Widom distribution corresponding to the GUE random matrices, while for the absorbing and reflecting cases we get the Tracy-Widom distribution corresponding to GOE random matrices. In the absorbing case, the reunion probability is also identified as the maximal height of N non-intersecting Brownian excursions ("watermelons" with a wall) whose distribution in the asymptotic scaling limit is then described by GOE Tracy-Widom law. In addition, large deviation formulas for the maximum height are also computed.Comment: 37 pages, 4 figures, revised and published version. A typo has been corrected in Eq. (10