Related papers: Propagation of 2-Monotone Lower Probabilities on a…
A simple algorithm is presented to decompose any 1-loop amplitude for scattering processes of the class 2 fermions -> 4 fermions into a fixed number of gauge-invariant form factors. The structure of the amplitude is simpler than in the…
A recently proposed method of calculating scalar two-loop propagator and vertex functions with massive particles is illustrated with simple examples. A double integral representation is derived with the example of a propagator function. An…
We obtain exact expressions for the asymptotic behaviour of the average probability of the block decoding error for ensembles of regular low density parity check error correcting codes, by employing diagrammatic techniques. Furthermore, we…
We show how to store good approximations of probability distributions in small space.
How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this question by introducing 'Local Separators' of graphs. Applications…
This article surveys computational methods for posterior inference with intractable likelihoods, that is where the likelihood function is unavailable in closed form, or where evaluation of the likelihood is infeasible. We review recent…
We establish an Ergodic Theorem for lower probabilities, a generalization of standard probabilities widely used in applications. As a by-product, we provide a version for lower probabilities of the Strong Law of Large Numbers.
We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting error probability as…
The exact homogenized probability density function, for a photon making a step of length $s$ has been analytically derived for a binary (isotropic-Poisson) statistical mixture with unmatched refractive indexes. The companions, exact,…
We study the problem of estimating precision matrices in Gaussian distributions that are multivariate totally positive of order two ($\mathrm{MTP}_2$). The precision matrix in such a distribution is an M-matrix. This problem can be…
We apply a general method for the estimation of completely positive maps to the 1-to-2 universal covariant cloning machine. The method is based on the maximum-likelihood principle, and makes use of random input states, along with random…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
The probability distribution of the conductance p(g) of disordered 2d and 3d systems is calculated by transfer matrix techniques. As expected, p(g) is Gaussian for extended states while for localized states it is log-normal. We find that at…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method…
Given a collection of probability distributions $p_{1},\ldots,p_{m}$, the minimum entropy coupling is the coupling $X_{1},\ldots,X_{m}$ ($X_{i}\sim p_{i}$) with the smallest entropy $H(X_{1},\ldots,X_{m})$. While this problem is known to be…
In this paper we develop a bivariate discrete generalized exponential distribution, whose marginals are discrete generalized exponential distribution as proposed by Nekoukhou, Alamatsaz and Bidram ("Discrete generalized exponential…
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…
This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which unreliable communication links may drop packets. We consider…
This paper introduces a novel method for the automatic detection and handling of nonlinearities in a generic transformation. A nonlinearity index that exploits second order Taylor expansions and polynomial bounding techniques is first…