Discriminating between causal structures in Bayesian Networks given partial observations

Philipp Moritz; Jörg Reichardt; Nihat Ay

Displaying similar documents to “Discriminating between causal structures in Bayesian Networks given partial observations”

A comparison of evidential networks and compositional models

Jiřina Vejnarová (2014)

Kybernetika

Similarity:

Several counterparts of Bayesian networks based on different paradigms have been proposed in evidence theory. Nevertheless, none of them is completely satisfactory. In this paper we will present a new one, based on a recently introduced concept of conditional independence. We define a conditioning rule for variables, and the relationship between conditional independence and irrelevance is studied with the aim of constructing a Bayesian-network-like model. Then, through a simple example,...

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system $ℋ$ is star-like with...

Entropy and growth of expanding periodic orbits for one-dimensional maps

A. Katok, A. Mezhirov (1998)

Fundamenta Mathematicae

Similarity:

Let f be a continuous map of the circle $S^{1}$ or the interval I into itself, piecewise $C^{1}$ , piecewise monotone with finitely many intervals of monotonicity and having positive entropy h. For any ε > 0 we prove the existence of at least $e^{(h - ε) n_{k}}$ periodic points of period $n_{k}$ with large derivative along the period, $| {(f^{n_{k}})}^{'} | > e^{(h - ε) n_{k}}$ for some subsequence $n_{k}$ of natural numbers. For a strictly monotone map f without critical points we show the existence of at least $(1 - ε) e^{h n}$ such points.

On solution sets of information inequalities

Nihat Ay, Walter Wenzel (2012)

Kybernetika

Similarity:

We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce structural properties of Bayesian networks, which is important within causal inference.

The Dugundji extension property can fail in ωµ -metrizable spaces

Ian Stares, Jerry Vaughan (1996)

Fundamenta Mathematicae

Similarity:

We show that there exist $ω_{μ}$ -metrizable spaces which do not have the Dugundji extension property ( $2^{ω_{1}}$ with the countable box topology is such a space). This answers a question posed by the second author in 1972, and shows that certain results of van Douwen and Borges are false.

A strongly non-Ramsey uncountable graph

Péter Komjáth (1997)

Fundamenta Mathematicae

Similarity:

It is consistent that there exists a graph X of cardinality $ℵ_{1}$ such that every graph has an edge coloring with $ℵ_{1}$ colors in which the induced copies of X (if there are any) are totally multicolored (get all possible colors).

Analytic determinacy and 0# A forcing-free proof of Harrington’s theorem

Ramez Sami (1999)

Fundamenta Mathematicae

Similarity:

We prove the following theorem: Given a⊆ω and $1 \leq α < ω_{1}^{C K}$ , if for some $η < ℵ_{1}$ and all u ∈ WO of length η, a is $Σ_{α}^{0} (u)$ , then a is $Σ_{α}^{0}$ . We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: $Σ_{1}^{1}$ -Turing-determinacy implies the existence of $0$ .

Chaotic continua of (continuum-wise) expansive homeomorphisms and chaos in the sense of Li and Yorke

Hisao Kato (1994)

Fundamenta Mathematicae

Similarity:

A homeomorphism f : X → X of a compactum X is expansive (resp. continuum-wise expansive) if there is c > 0 such that if x, y ∈ X and x ≠ y (resp. if A is a nondegenerate subcontinuum of X), then there is n ∈ ℤ such that $d (f^{n} (x), f^{n} (y)) > c$ (resp. $d i a m f^{n} (A) > c$ ). We prove the following theorem: If f is a continuum-wise expansive homeomorphism of a compactum X and the covering dimension of X is positive (dim X > 0), then there exists a σ-chaotic continuum Z = Z(σ) of f (σ = s or σ = u), i.e. Z is a nondegenerate...

On an algorithm for testing T4 solvability of max-plus interval systems

Helena Myšková (2012)

Kybernetika

Similarity:

In this paper, we shall deal with the solvability of interval systems of linear equations in max-plus algebra. Max-plus algebra is an algebraic structure in which classical addition and multiplication are replaced by $\oplus$ and $\otimes$ , where $a \oplus b = max {a, b}$ , $a \otimes b = a + b$ . The notation $𝔸 \otimes x = 𝕓$ represents an interval system of linear equations, where $𝔸 = [\bar{b}, \bar{A}]$ and $𝕓 = [\underset{̲}{b}, \bar{b}]$ are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 solvability and...