Many applications call for learning causal models from relational data. We investigate Relational Causal Models (RCM) under relational counterparts of adjacency-faithfulness and orientation-faithfulness, yielding a simple approach to identifying a subset of relational d-separation queries needed for determining the structure of an RCM using d-separation against an unrolled DAG representation of...

Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurrent transactions corresponds to some serial execution of the same transactions. Many important business applications, however, require the system to impose a partial serialization order between transactions pinned to a ...

Lexical morphemes in Emai are a “privileged position” compared to functional ones: The vowel in the function morpheme is tampered with to spare the vowel in the lexical morpheme. Previous research has identified phonological privilege in several other positions, including word-initial syllables (Beckman, 1998), stressed syllables (Alderete, 1995), syllable onsets (Lombardi, 1999), nouns (Smith,...

Causal effect estimation from observational data is an important and much studied research topic. The instrumental variable (IV) and local causal discovery (LCD) patterns are canonical examples of settings where a closed-form expression exists for the causal effect of one variable on another, given the presence of a third variable. Both rely on faithfulness to infer that the latter only influen...

Pima (Uto-Aztecan, central Arizona) pluralizes nouns via partial reduplication. The amount of material copied varies between a single C (mavit / ma-m-vit ‘lion(s)’) and CV (hodai / ho-ho-dai ‘rock(s)’). The former is preferred unless copying a single C would give rise to an illicit coda or cluster, in which case CV is copied. In contrast to previous analyses of similar patterns in Tohono O’odha...

In the Optimality-Theoretic learnability and acquisition literature it has been proposed that certain classes of constraints must be biased toward particular rankings (e.g., Markedness >> IO-Faithfulness; Specific IO-Faithfulness >> General IO-Faithfulness). While sometimes difficult to implement efficiently or comprehensively, these biases are necessary to explain how learners acquire the most...

In this paper we analyze the relationship between faithfulness and the more recent condition of algorithmic Independence of Conditionals (IC) with respect to the Conditional Independencies (CIs) they allow. Both conditions have been extensively used for causal inference by refuting factorizations for which the condition does not hold. Violation of faithfulness happens when there are CIs that do...

Directed acyclic graphs can be used to infer associations between variables and specify their joint distribution. To infer these associations, an assumption called faithfulness must be satisfied. Faithfulness entails that the independencies that exist in the distribution are equivalent to those in the graph. Violations of the faithfulness assumption can occur because of parameter cancellations ...

Considering a certain construction of algebraic varieties X endowed with an action the group Aut(Fn), n < ∞, we obtain criterion for faithfulness this action. It gives infinite family

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer’s faithfulness proof for this linear representation to Artin groups of finite type.