Most causal discovery algorithms in the literature exploit an assumption usually referred to as the Causal Faithfulness or Stability Condition. In this paper, we highlight two components of the condition used in constraint-based algorithms, which we call “Adjacency-Faithfulness” and “OrientationFaithfulness.” We point out that assuming Adjacency-Faithfulness is true, it is possible to test the ...

This paper presents a theory of morphophonology based on a development in the theory of faithfulness in Optimality Theory. A new constraint type, antifaithfulness, is proposed that evaluates a pair of related words and requires an alternation in the shared stem. This constraint type is motivated initially by a set of problems, e.g. morphological deletions, segmental exchanges and non-structure ...

Cheng, Greiner, Kelly, Bell and Liu [Artificial Intelligence 137 (2002) 43–90] describe an algorithm for learning Bayesian networks that—in a domain consisting of n variables—identifies the optimal solution using O(n4) calls to a mutual-information oracle. This result relies on (1) the standard assumption that the generative distribution is Markov and faithful to some directed acyclic graph (DA...

Readability criteria have been commonly used to measure the quality of graph visualizations. In this paper we argue that readability criteria, while necessary, are not sufficient. We propose a new kind of criterion, generically termed faithfulness, for evaluating graph layout methods. We propose a general model for quantifying faithfulness, and contrast it with the well established readability ...

We introduce a novel property of bipartite quantum states, which we call faithfulness, and we say that a state is faithful when acting with a channel on one of the two quantum systems; the output state carries complete information about the channel. The concept of faithfulness can also be extended to sets of states, when the output states altogether carry a complete imprinting of the channel. M...

Readability criteria have been addressed as a measurement of the quality of graph visualizations. In this paper, we argue that readability criteria are necessary but not sufficient. We propose a new kind of criteria, namely faithfulness, to evaluate the quality of graph layouts. We introduce a general model for quantify faithfulness, and contrast it with the well established readability criteri...

In this paper we analyze the duality between two faithfulness assumptions that can be defined on a given multivariate probability distribution of a set of random variables. The first pertains to faithfulness to its concentration graph and the second pertains to faithfulness to its covariance graph. The vertices in both these graphs are in a oneto-one correspondence with the set of variables in ...