312 research outputs found

    Linear optics implementation of weak values in Hardy's paradox

    Full text link
    We propose an experimental setup for the implementation of weak measurements in the context of the gedankenexperiment known as Hardy's Paradox. As Aharonov et al. showed, these weak values form a language with which the paradox can be resolved. Our analysis shows that this language is indeed consistent and experimentally testable. It also reveals exactly how a combination of weak values can give rise to an apparently paradoxical result.Comment: 4 pages, accepted by PR

    Reply to "Comment on 'A linear optics implementation of weak values in Hardy's paradox'"

    Full text link
    The comment by Lundeen et al. contains two criticisms of our proposal. While we agree that the state-preparation procedure could be replaced by a simpler setup as proposed by the authors of the comment, we do not agree with the authors on their second, and more important point regarding two-particle weak measurements. We believe this to be the result of a misunderstanding of our original paper.Comment: 2 pages, accepted in PR

    A Community Under Attack: Protestant Letter Networks in the Reign of Mary I

    Get PDF
    This is a manuscript version of the article which has been accepted for publication in Leonardo. The final published version can be found here: http://dx.doi.org/10.1162/LEON_a_00778This article uses mathematical and computational techniques to reconstruct and analyze the social and textual organization of the underground community of Protestants living in England during the reign of Mary I from 289 surviving letters. © 2014 ISAST

    Evolution of interface binding strengths in simplified model of protein quaternary structure.

    Get PDF
    The self-assembly of proteins into protein quaternary structures is of fundamental importance to many biological processes, and protein misassembly is responsible for a wide range of proteopathic diseases. In recent years, abstract lattice models of protein self-assembly have been used to simulate the evolution and assembly of protein quaternary structure, and to provide a tractable way to study the genotype-phenotype map of such systems. Here we generalize these models by representing the interfaces as mutable binary strings. This simple change enables us to model the evolution of interface strengths, interface symmetry, and deterministic assembly pathways. Using the generalized model we are able to reproduce two important results established for real protein complexes: The first is that protein assembly pathways are under evolutionary selection to minimize misassembly. The second is that the assembly pathway of a complex mirrors its evolutionary history, and that both can be derived from the relative strengths of interfaces. These results demonstrate that the generalized lattice model offers a powerful new idealized framework to facilitate the study of protein self-assembly processes and their evolution

    Weak Measurement of the Arrival Times of Single Photons and Pairs of Entangled Photons

    Full text link
    In this paper we propose a setup for the weak measurement of photon arrival time. It is found that the weak values of this arrival time can lie far away from the expectation value, and in principle also in regions forbidden by special relativity. We discuss in brief the implications of these results as well as their reconciliation with the principle of causality. Furthermore, an analysis of the weak arrival times of a pair of photons in a Bell state shows that these weak arrival times are correlated.Comment: 4 pages, 1 figur

    Gene duplication and subsequent diversification strongly affect phenotypic evolvability and robustness.

    Get PDF
    We study the effects of non-determinism and gene duplication on the structure of genotype-phenotype (GP) maps by introducing a non-deterministic version of the Polyomino self-assembly model. This model has previously been used in a variety of contexts to model the assembly and evolution of protein quaternary structure. Firstly, we show the limit of the current deterministic paradigm which leads to built-in anti-correlation between evolvability and robustness at the genotypic level. We develop a set of metrics to measure structural properties of GP maps in a non-deterministic setting and use them to evaluate the effects of gene duplication and subsequent diversification. Our generalized versions of evolvability and robustness exhibit positive correlation for a subset of genotypes. This positive correlation is only possible because non-deterministic phenotypes can contribute to both robustness and evolvability. Secondly, we show that duplication increases robustness and reduces evolvability initially, but that the subsequent diversification that duplication enables has a stronger, inverse effect, greatly increasing evolvability and reducing robustness relative to their original values

    An ensemble approach to the analysis of weighted networks

    Get PDF
    We present a new approach to the calculation of measures in weighted networks, based on the translation of a weighted network into an ensemble of edges. This leads to a straightforward generalization of any measure defined on unweighted networks, such as the average degree of the nearest neighbours, the clustering coefficient, the `betweenness', the distance between two nodes and the diameter of a network. All these measures are well established for unweighted networks but have hitherto proven difficult to define for weighted networks. Further to introducing this approach we demonstrate its advantages by applying the clustering coefficient constructed in this way to two real-world weighted networks.Comment: 4 pages 3 figure

    Applying weighted network measures to microarray distance matrices

    Full text link
    In recent work we presented a new approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks. This approach is based on the translation of a weighted network into an ensemble of edges, and is particularly suited to the analysis of fully connected weighted networks. Here we apply our method to several such networks including distance matrices, and show that the clustering coefficient, constructed by using the ensemble approach, provides meaningful insights into the systems studied. In the particular case of two data sets from microarray experiments the clustering coefficient identifies a number of biologically significant genes, outperforming existing identification approaches.Comment: Accepted for publication in J. Phys.
    • …
    corecore