A completeness result for d-separation ap­ plied to discrete Bayesian networks is pre­ sented 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 independence facts true of the distribution are all and only those en­ tailed by the network structure.

This paper deals with multivariate regression chain graphs, which were introduced by Cox and Wermuth (1993, 1996) to represent linear causal models with correlated errors. Specifically, we present a constraint based algorithm for learning a chain graph a given probability distribution is faithful to. We also show that for each Markov equivalence class of multivariate regression chain graphs the...

Synchronic chain shifts, whereby certain sounds are promoted (or demoted) stepwise along some phonetic scale in some context, are one of the classic cases of opaque rule interactions (see, e.g., Kenstowicz and Kisseberth 1977). If, for example, /a/ raises to [e], and /e/ raises to [i], it would appear that the /e/ ® [i] raising must precede /a/ ® [e] raising in the derivation, otherwise /a/ and...

This work investigates user attitudes towards personalized summaries generated from a coarse-grained user model based on document aspects. We explore user preferences for summaries at differing degrees of fit with their stated interests, the impact of length on user ratings, and the faithfulness of personalized and general summaries.

Recent experimental work indicates that by the age of ten months, infants have already learned a great deal about the phonotactics (legal sounds and sound sequences) of their language. This learning occurs before infants can utter words or apprehend most phonological alternations. I will show that this early learning stage can be straightforwardly modeled with Optimality Theory. Specifically, t...

In this paper, based on the signaling mechanism of phosphorylation and dephosphorylation, we have designed rewriting rules for graph automata by related pathways in kinase computing for 3-SAT problem solving in which linear complexity of control-space and time is derived to achieve efficiency in theory. This work is important for pathway design of autonomous kinase computation that has biologic...

The Burau representation enables to define many other representations of the braid group Bn by the topological operation of “cabling braids”. We show here that these representations split into copies of the Burau representation itself and of a representation of Bn/(Pn, Pn). In particular, we show that there is no gain in terms of faithfulness by cabling the Burau representation.

This paper uses an axiomatic approach to study the properties of voting procedures. We propose a new axiom, called “group support,” which requires that an alternative that is selected by a society must be selected by some subgroup of the society. We show that group support and faithfulness characterize a class of scoring rules that we call topheavy rules. JEL Classification: D71

In this paper we introduce a basic representation for the confluent Cherednik algebras HV, HIII, H7 III and H D8 III defined in arXiv:1307.6140. To prove faithfulness of this basic representation, we introduce the non-symmetric versions of the continuous dual qHahn, Al-Salam–Chihara, continuous big q-Hermite and continuous q-Hermite polynomials.

The two most controversial aspects of vowel harmony in Korean ideophones are its morphologically restricted nature and the harmonic feature governing these alternations. Not only is the harmony pattern restricted to the ideophone class2, but also the value of the harmonic feature determines the meaning of the ideophone itself. While alternations from one feature to another involve relative lowe...