• Canada
• National Science Foundation close

We investigate, for two water models displaying a liquid-liquid critical point, the relation between changes in dynamic and thermodynamic anomalies arising from the presence of the liquid-liquid critical point. We find a correlation between the dynamic fragility transition and the locus of specific heat maxima $C_P^{\rm max}$ (``Widom line'') emanating from the critical point. Our findings are consistent with a possible relation between the previously hypothesized liquid-liquid phase transition and the transition in the dynamics recently observed in neutron scattering experiments on confined water. More generally, we argue that this connection between $C_P^{\rm max}$ and dynamic crossover is not limited to the case of water, a hydrogen bond network forming liquid, but is a more general feature of crossing the Widom line. Specifically, we also study the Jagla potential, a spherically-symmetric two-scale potential known to possess a liquid-liquid critical point, in which the competition between two liquid structures is generated by repulsive and attractive ramp interactions. Comment: 6 pages and 5 figures

Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question because in several other settings maximally entangled states are known to be less useful as a resource than some partially entangled state. These include non-local games, tasks with quantum communication between players and referee, and simulating bipartite unitaries or communication channels. By contrast, we prove that the bounded-error entanglement-assisted quantum communication complexity of a function cannot be improved by more than a constant factor by replacing maximally entangled states with arbitrary entangled states. In particular, we show that every quantum communication protocol using $Q$ qubits of communication and arbitrary shared entanglement can be $\epsilon$-approximated by a protocol using $O(Q/\epsilon+\log(1/\epsilon)/\epsilon)$ qubits of communication and only EPR pairs as shared entanglement. Our second result concerns an old question in quantum information theory: How much quantum communication is required to approximately convert one pure bipartite entangled state into another? We show that the communication cost of converting between two bipartite quantum states is upper bounded, up to a constant multiplicative factor, by a natural and efficiently computable quantity which we call the $\ell_{\infty}$-Earth Mover's Distance (EMD) between those two states. Furthermore, we prove a complementary lower bound on the cost of state conversion by the $\epsilon$-smoothed $\ell_{\infty}$-EMD, which is a natural smoothing of the $\ell_{\infty}$-EMD that we will define via a connection with optimal transport theory.

Standard tomographic analyses ignore model uncertainty. It is assumed that a given model generated the data and the task is to estimate the quantum state, or a subset of parameters within that model. Here we apply a model averaging technique to mitigate the risk of overconfident estimates of model parameters in two examples: (1) selecting the rank of the state in tomography and (2) selecting the model for the fidelity decay curve in randomized benchmarking. For a summary, see http://i.imgur.com/nMJxANo.png

© 2016 Elyashiv et al. Natural selection at one site shapes patterns of genetic variation at linked sites. Quantifying the effects of “linked selection” on levels of genetic diversity is key to making reliable inference about demography, building a null model in scans for targets of adaptation, and learning about the dynamics of natural selection. Here, we introduce the first method that jointly infers parameters of distinct modes of linked selection, notably background selection and selective sweeps, from genome-wide diversity data, functional annotations and genetic maps. The central idea is to calculate the probability that a neutral site is polymorphic given local annotations, substitution patterns, and recombination rates. Information is then combined across sites and samples using composite likelihood in order to estimate genome-wide parameters of distinct modes of selection. In addition to parameter estimation, this approach yields a map of the expected neutral diversity levels along the genome. To illustrate the utility of our approach, we apply it to genome-wide resequencing data from 125 lines in Drosophila melanogaster and reliably predict diversity levels at the 1Mb scale. Our results corroborate estimates of a high fraction of beneficial substitutions in proteins and untranslated regions (UTR). They allow us to distinguish between the contribution of sweeps and other modes of selection around amino acid substitutions and to uncover evidence for pervasive sweeps in untranslated regions (UTRs). Our inference further suggests a substantial effect of other modes of linked selection and of adaptation in particular. More generally, we demonstrate that linked selection has had a larger effect in reducing diversity levels and increasing their variance in D. melanogaster than previously appreciated.

Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in most applications, the success of MOT is severely limited by a lack of efficient algorithms. Indeed, MOT in general requires exponential time in the number of marginals k and their support sizes n. This paper develops a general theory about what "structure" makes MOT solvable in poly(n,k) time. We develop a unified algorithmic framework for solving MOT in poly(n,k) time by characterizing the "structure" that different algorithms require in terms of simple variants of the dual feasibility oracle. This framework has several benefits. First, it enables us to show that the Sinkhorn algorithm, which is currently the most popular MOT algorithm, requires strictly more structure than other algorithms do to solve MOT in poly(n,k) time. Second, our framework makes it much simpler to develop poly(n,k) time algorithms for a given MOT problem. In particular, it is necessary and sufficient to (approximately) solve the dual feasibility oracle -- which is much more amenable to standard algorithmic techniques. We illustrate this ease-of-use by developing poly(n,k) time algorithms for three general classes of MOT cost structures: (1) graphical structure; (2) set-optimization structure; and (3) low-rank plus sparse structure. For structure (1), we recover the known result that Sinkhorn has poly(n,k) runtime; moreover, we provide the first poly(n,k) time algorithms for computing solutions that are exact and sparse. For structures (2)-(3), we give the first poly(n,k) time algorithms, even for approximate computation. Together, these three structures encompass many -- if not most -- current applications of MOT. v4: to appear in Mathematical Programming, improved exposition and refs, no changes to technical results

The first eigenvalue of the Laplacian on a surface can be viewed as a functional on the space of Riemannian metrics of a given area. Critical points of this functional are called extremal metrics. The only known extremal metrics are a round sphere, a standard projective plane, a Clifford torus and an equilateral torus. We construct an extremal metric on a Klein bottle. It is a metric of revolution, admitting a minimal isometric embedding into a 4-sphere by the first eigenfunctions. Also, this Klein bottle is a bipolar surface for the Lawson's {3,1}-torus. We conjecture that an extremal metric for the first eigenvalue on a Klein bottle is unique, and hence it provides a sharp upper bound for the first eigenvalue on a Klein bottle of a given area. We present numerical evidence and prove the first results towards this conjecture. 20 pages; minor corrections

Abstract A characterization of n-vertex isolate-free connected graphs G whose domination number γ ( G ) satisfies γ(G)=⌊n/2⌋ is obtained. This result enables us to obtain extremal graphs of inequalities which bound the sum of two domination parameters in isolate-free graphs.

We present three maps of the millimeter-wave sky created by combining data from the South Pole Telescope (SPT) and the Planck satellite. We use data from the SPT-SZ survey, a survey of 2540 deg$^2$ of the the sky with arcminute resolution in three bands centered at 95, 150, and 220 GHz, and the full-mission Planck temperature data in the 100, 143, and 217 GHz bands. A linear combination of the SPT-SZ and Planck data is computed in spherical harmonic space, with weights derived from the noise of both instruments. This weighting scheme results in Planck data providing most of the large-angular-scale information in the combined maps, with the smaller-scale information coming from SPT-SZ data. A number of tests have been done on the maps. We find their angular power spectra to agree very well with theoretically predicted spectra and previously published results. 21 pages, 12 figures

The $s$-process nucleosynthesis in Asymptotic Giant Branch (AGB) stars depends on the modeling of convective boundaries. We present models and s-process simulations that adopt a treatment of convective boundaries based on the results of hydrodynamic simulations and on the theory of mixing due to gravity waves in the vicinity of convective boundaries. Hydrodynamics simulations suggest the presence of convective boundary mixing (CBM) at the bottom of the thermal pulse-driven convective zone. Similarly, convection-induced mixing processes are proposed for the mixing below the convective envelope during third dredge-up where the 13C pocket for the s process in AGB stars forms. In this work we apply a CBM model motivated by simulations and theory to models with initial mass $M = 2$ and $M = 3M_\odot$, and with initial metal content Z = 0.01 and Z = 0.02. As reported previously, the He-intershell abundance of 12C and 16O are increased by CBM at the bottom of pulse-driven convection zone. This mixing is affecting the $^{22}Ne(��,n)^{25}Mg$ activation and the s-process effciency in the 13C-pocket. In our model CBM at the bottom of the convective envelope during the third dredgeup represents gravity wave mixing. We take further into account that hydrodynamic simulations indicate a declining mixing efficiency already about a pressure scale height from the convective boundaries, compared to mixing-length theory. We obtain the formation of the 13C-pocket with a mass of $\approx 10^{-4}M_\odot$. The final $s$-process abundances are characterized by 0.36 < [s=Fe] < 0.78 and the heavy-to-light s-process ratio is 0.23 < [hs=ls] < 0.45. Finally, we compare our results with stellar observations, pre-solar grain measurements and previous work. Submitted to ApJ on 11-24-2015. Accepted on 5-17-2016 (Manuscript #: ApJ101257)

We construct a new effective orbifold $\widehat{\Y}$ with an $S^1$-gerbe $c$ to study an $S^1$-gerbe $\mathfrak{t}$ on a $G$-gerbe $\Y$ over an orbifold $\B$. We view the former as the relative dual, relative to $\B$, of the latter. We show that the two pairs $(\Y, \mathfrak{t})$ and $(\widehat{\Y}, c)$ have isomorphic categories of sheaves, and also the associated twisted groupoid algebras are Morita equivalent. As a corollary, the K-theory and cohomology groups of $(\Y, \mathfrak{t})$ and $(\widehat{\Y}, c)$ are isomorphic. 16 pages