Related papers: Propagation of 2-Monotone Lower Probabilities on a…
This article considers the computational (acoustic) wave propagation in strongly heterogeneous structures beyond the assumption of periodicity. A high contrast between the constituents of microstructured multiphase materials can lead to…
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms.…
A functional composition of the cumulative distribution function of one probability distribution with the inverse cumulative distribution function of another is called the transmutation map. In this article, we will use the quadratic rank…
In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…
The ability to estimate joint, conditional and marginal probability distributions over some set of variables is of great utility for many common machine learning tasks. However, estimating these distributions can be challenging,…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
Posterior distribution over a countable set M of continuous data-sampling distributions piles up at L-projection of the true distribution r on M, provided that the L-projection is unique. If there are several L-projections of r on M, then…
The concept of negative probabilities can be used to decompose the interaction of two qubits mediated by a quantum controlled-NOT into three operations that require only classical interactions (that is, local operations and classical…
This paper presents a tractable analytical framework for the exact calculation of probability of node isolation and minimum node degree distribution when $N$ sensor nodes are independently and uniformly distributed inside a finite square…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
We provide algorithms for the minimum 2-edge-connected spanning subgraph problem and the minimum 2-vertex-connected spanning subgraph problem with approximation ratio both $\frac{4}{3}$. Using a common theme, the algorithms and their…
The field of molecular excitons and related supramolecular systems has largely focused on aggregates where nearest-neighbour couplings dominate. We propose that radically different states can be produced by moving beyond that paradigm. In…
We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.
We present a method which allows to extract theoretical informations out of a limited set of experimental data and observables, forming up in general an under- constrained system. It has been applied to the field of nucleon structure, in…
In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on…
An algorithm for obtaining the Taylor coefficients of an expansion of Feynman diagrams is proposed. It is based on recurrence relations which can be applied to the propagator as well as to the vertex diagrams. As an application, several…
We determine the algebraic structure of the multiplicative loops for locally compact $2$-dimensional topological connected quasifields. In particular, our attention turns to multiplicative loops which have either a normal subloop of…
In this manuscript, we introduce an exact expression for the response of a semi-classical two-level quantum system subject to arbitrary periodic driving. Determining the transition probabilities of a two-level system driven by an arbitrary…
We introduce the lifted Generalized Belief Propagation (GBP) message passing algorithm, for the computation of sum-product queries in Probabilistic Relational Models (e.g. Markov logic network). The algorithm forms a compact region graph…
In one dimensional transport problems the scattering matrix $S$ is decomposed into a block structure corresponding to reflection and transmission matrices at the two ends. For $S$ a random unitary matrix, the singular value probability…