Related papers: On modular decompositions of system signatures
The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with the partition function whose integrand is not real positive. The basic idea of the factorization method applied on such a system is to control…
Randomness is an intrinsic feature of quantum theory. The outcome of any quantum measurement will be random, sampled from a probability distribution that is defined by the measured quantum state. The task of sampling from a prescribed…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
Composition is an important feature of a specification language, as it enables the design of a complex system in terms of a product of its parts. Decomposition is equally important in order to reason about structural properties of a system.…
A certain type of integer grid, called here an echelon grid, is an object found both in coherent systems whose components have a finite or countable number of levels and in algebraic geometry. If \alpha=(\alpha_1,...,\alpha_d) is an integer…
Systems biology models are useful models of complex biological systems that may require a large amount of experimental data to fit each model's parameters or to approximate a likelihood function. These models range from a few to thousands…
A load sharing system has several components and the failure of one component can affect the lifetime of the surviving components. Since component failure does not equate to system failure for different system designs, the analysis of the…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
This paper suggests a [email protected] of composable specification of concurrent programs that permits: (1) verification of program code for a given specification, and (2) composition of the specifications of the components to yield…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…
Due to the importance of signature vector in studying the reliability of networks, some methods have been proposed by researchers to obtain the signature. The notion of signature is used when at most one link may fail at each time instant.…
In this paper, we investigate various stochastic orderings for series and parallel systems with independent and heterogeneous components having lifetimes following the proportional odds model. We also investigate comparisons between system…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning…
We study the so-called closed and splitting subsemimodules and submodules of a given semimodule or module, respectively. We describe lattices of subsemimodules and of closed subsemimodules and posets of splitting subsemimodules and…
A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some…
Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way. Several open dynamical systems can be…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…