9,658 research outputs found

    On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers

    Get PDF
    We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is related to the evaluation of the Jones and Tutte polynomials. We consider the connection between the weight enumerator polynomial from coding theory and Z and exploit the fact that there exists a quantum algorithm for efficiently estimating Gauss sums in order to obtain the weight enumerator for a certain class of linear codes. In this way we demonstrate that for a certain class of sparse graphs, which we call Irreducible Cyclic Cocycle Code (ICCC_\epsilon) graphs, quantum computers provide a polynomial speed up in the difference between the number of edges and vertices of the graph, and an exponential speed up in q, over the best classical algorithms known to date

    Multilinear tensor regression for longitudinal relational data

    Full text link
    A fundamental aspect of relational data, such as from a social network, is the possibility of dependence among the relations. In particular, the relations between members of one pair of nodes may have an effect on the relations between members of another pair. This article develops a type of regression model to estimate such effects in the context of longitudinal and multivariate relational data, or other data that can be represented in the form of a tensor. The model is based on a general multilinear tensor regression model, a special case of which is a tensor autoregression model in which the tensor of relations at one time point are parsimoniously regressed on relations from previous time points. This is done via a separable, or Kronecker-structured, regression parameter along with a separable covariance model. In the context of an analysis of longitudinal multivariate relational data, it is shown how the multilinear tensor regression model can represent patterns that often appear in relational and network data, such as reciprocity and transitivity.Comment: Published at http://dx.doi.org/10.1214/15-AOAS839 in the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

    A Fredholm Determinant for Semi-classical Quantization

    Get PDF
    We investigate a new type of approximation to quantum determinants, the ``\qFd", and test numerically the conjecture that for Axiom A hyperbolic flows such determinants have a larger domain of analyticity and better convergence than the \qS s derived from the \Gt. The conjecture is supported by numerical investigations of the 3-disk repeller, a normal-form model of a flow, and a model 2-dd map.Comment: Revtex, Ask for figures from [email protected]

    On Bounded Weight Codes

    Full text link
    The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters

    Assumptions of IV Methods for Observational Epidemiology

    Full text link
    Instrumental variable (IV) methods are becoming increasingly popular as they seem to offer the only viable way to overcome the problem of unobserved confounding in observational studies. However, some attention has to be paid to the details, as not all such methods target the same causal parameters and some rely on more restrictive parametric assumptions than others. We therefore discuss and contrast the most common IV approaches with relevance to typical applications in observational epidemiology. Further, we illustrate and compare the asymptotic bias of these IV estimators when underlying assumptions are violated in a numerical study. One of our conclusions is that all IV methods encounter problems in the presence of effect modification by unobserved confounders. Since this can never be ruled out for sure, we recommend that practical applications of IV estimators be accompanied routinely by a sensitivity analysis.Comment: Published in at http://dx.doi.org/10.1214/09-STS316 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org

    On the number of limit cycles in asymmetric neural networks

    Full text link
    The comprehension of the mechanisms at the basis of the functioning of complexly interconnected networks represents one of the main goals of neuroscience. In this work, we investigate how the structure of recurrent connectivity influences the ability of a network to have storable patterns and in particular limit cycles, by modeling a recurrent neural network with McCulloch-Pitts neurons as a content-addressable memory system. A key role in such models is played by the connectivity matrix, which, for neural networks, corresponds to a schematic representation of the "connectome": the set of chemical synapses and electrical junctions among neurons. The shape of the recurrent connectivity matrix plays a crucial role in the process of storing memories. This relation has already been exposed by the work of Tanaka and Edwards, which presents a theoretical approach to evaluate the mean number of fixed points in a fully connected model at thermodynamic limit. Interestingly, further studies on the same kind of model but with a finite number of nodes have shown how the symmetry parameter influences the types of attractors featured in the system. Our study extends the work of Tanaka and Edwards by providing a theoretical evaluation of the mean number of attractors of any given length LL for different degrees of symmetry in the connectivity matrices.Comment: 35 pages, 12 figure
    corecore