Related papers: Factorization of network reliability with perfect …
A completeness result for d-separation applied to discrete Bayesian networks is presented and it is shown that in a strong measure-theoretic sense almost all discrete distributions for a given network structure are faithful; i.e. the…
We examine a node centrality measure based on the notion of total communicability, defined in terms of the row sums of the exponential of the adjacency matrix of the network. We argue that this is a natural metric for ranking nodes in a…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
In this paper we prove a general theorem on the extensions of local nets which was inspired by recent examples of exotic extensions for Virasoro nets with central charge less than one and earlier work on cosets and conformal inclusions.…
The two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan have been calculated exactly for arbitrary size as well as arbitrary individual edge and node reliabilities, using transfer matrices of dimension…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
In this paper, we obtain some factorization results on formal power series over principle ideal domains with sharp bounds on number of irreducible factors. These factorization results correspondingly lead to irreducibility criteria for…
Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…
It is well-known that the factorization properties of a domain are reflected in the structure of its group of divisibility. The main theme of this paper is to introduce a topological/graph-theoretic point of view to the current…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…
This paper discusses the reliability of a graph in which the links are perfectly reliable but the nodes may fail with certain probability p. Calculating graph node reliability is an NP-Hard problem. We introduce an efficient and accurate…
We present a general strategy that allows a more flexible method for the construction of fully additive multipartite entanglement monotones than the ones so far reported in the literature of axiomatic entanglement measures. Within this…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ are operational independently with probability $p \in[0,1]$. For fixed vertices $s$ and $t$, the \emph{two-terminal reliability} of $G$ is the probability…
We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the…
We present a generalization of Warning's Second Theorem to polynomial systems over a finite local principal ring with suitably restricted input and output variables. This generalizes a recent result with Forrow and Schmitt (and gives a new…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
We introduce a new factorial function which agrees with the usual Euler gamma function at both the positive integers and at all half-integers, but which is also entire. We describe the basic features of this function.