Dynamic communicability predicts infectiousness

Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network.We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures

Logarithmic mathematical morphology: a new framework adaptive to illumination changes

A new set of mathematical morphology (MM) operators adaptive to illumination changes caused by variation of exposure time or light intensity is defined thanks to the Logarithmic Image Processing (LIP) model. This model based on the physics of acquisition is consistent with human vision. The fundamental operators, the logarithmic-dilation and the logarithmic-erosion, are defined with the LIP-addition of a structuring function. The combination of these two adjunct operators gives morphological filters, namely the logarithmic-opening and closing, useful for pattern recognition. The mathematical relation existing between ``classical'' dilation and erosion and their logarithmic-versions is established facilitating their implementation. Results on simulated and real images show that logarithmic-MM is more efficient on low-contrasted information than ``classical'' MM

Six-Loop Anomalous Dimension of Twist-Three Operators in N=4 SYM

The result for the six-loop anomalous dimension of twist-three operators in the planar N=4 SYM theory is presented. The calculations were performed along the paper arXiv:0912.1624. This result provides a new data for testing the proposed spectral equations for planar AdS/CFT correspondence.Comment: 19 pages, typos corrected, details adde

ABJ(M) Chiral Primary Three-Point Function at Two-loops

This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.archiveprefix: arXiv primaryclass: hep-th reportnumber: QMUL-PH-14-10 slaccitation: %%CITATION = ARXIV:1404.1117;%%archiveprefix: arXiv primaryclass: hep-th reportnumber: QMUL-PH-14-10 slaccitation: %%CITATION = ARXIV:1404.1117;%%archiveprefix: arXiv primaryclass: hep-th reportnumber: QMUL-PH-14-10 slaccitation: %%CITATION = ARXIV:1404.1117;%%Article funded by SCOAP

Taming the zoo of supersymmetric quantum mechanical models

We show that in many cases nontrivial and complicated supersymmetric quantum mechanical (SQM) models can be obtained from the simple model describing free dynamics in flat complex space by two operations: (i) Hamiltonian reduction and (ii) similarity transformation of the complex supercharges. We conjecture that it is true for any SQM model.Comment: final version published in JHE

Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems

Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions. We are particularly interested in problems arising in combinatorial optimization.Comment: 28 pages, survey pape

Electroweak Gauge-Boson Production at Small q_T: Infrared Safety from the Collinear Anomaly

Using methods from effective field theory, we develop a novel, systematic framework for the calculation of the cross sections for electroweak gauge-boson production at small and very small transverse momentum q_T, in which large logarithms of the scale ratio M_V/q_T are resummed to all orders. These cross sections receive logarithmically enhanced corrections from two sources: the running of the hard matching coefficient and the collinear factorization anomaly. The anomaly leads to the dynamical generation of a non-perturbative scale q_* ~ M_V e^{-const/\alpha_s(M_V)}, which protects the processes from receiving large long-distance hadronic contributions. Expanding the cross sections in either \alpha_s or q_T generates strongly divergent series, which must be resummed. As a by-product, we obtain an explicit non-perturbative expression for the intercept of the cross sections at q_T=0, including the normalization and first-order \alpha_s(q_*) correction. We perform a detailed numerical comparison of our predictions with the available data on the transverse-momentum distribution in Z-boson production at the Tevatron and LHC.Comment: 34 pages, 9 figure

Measurement of finite-frequency current statistics in a single-electron transistor

Electron transport in nano-scale structures is strongly influenced by the Coulomb interaction which gives rise to correlations in the stream of charges and leaves clear fingerprints in the fluctuations of the electrical current. A complete understanding of the underlying physical processes requires measurements of the electrical fluctuations on all time and frequency scales, but experiments have so far been restricted to fixed frequency ranges as broadband detection of current fluctuations is an inherently difficult experimental procedure. Here we demonstrate that the electrical fluctuations in a single electron transistor (SET) can be accurately measured on all relevant frequencies using a nearby quantum point contact for on-chip real-time detection of the current pulses in the SET. We have directly measured the frequency-dependent current statistics and hereby fully characterized the fundamental tunneling processes in the SET. Our experiment paves the way for future investigations of interaction and coherence induced correlation effects in quantum transport.Comment: 7 pages, 3 figures, published in Nature Communications (open access

Trinets encode tree-child and level-2 phylogenetic networks

Phylogenetic networks generalize evolutionary trees, and are commonly used to represent evolutionary histories of species that undergo reticulate evolutionary processes such as hybridization, recombination and lateral gene transfer. Recently, there has been great interest in trying to develop methods to construct rooted phylogenetic networks from triplets, that is rooted trees on three species. However, although triplets determine or encode rooted phylogenetic trees, they do not in general encode rooted phylogenetic networks, which is a potential issue for any such method. Motivated by this fact, Huber and Moulton recently introduced trinets as a natural extension of rooted triplets to networks. In particular, they showed that level-1 level-1 phylogenetic networks are encoded by their trinets, and also conjectured that all “recoverable” rooted phylogenetic networks are encoded by their trinets. Here we prove that recoverable binary level-2 networks and binary tree-child networks are also encoded by their trinets. To do this we prove two decomposition theorems based on trinets which hold for all recoverable binary rooted phylogenetic networks. Our results provide some additional evidence in support of the conjecture that trinets encode all recoverable rooted phylogenetic networks, and could also lead to new approaches to construct phylogenetic networks from trinets