This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is proposed. The representative is based on revealed internal structure of the AMP Markov equivalence class. More specifically, the AMP Markov equivalence class decomposes into finer strong equivalence classes and there exist...

in this paper the class of n-ary hypergroups is introduced and several properties are found andexamples are presented. n-ary hypergroups are a generalization of hypergroups in the sense of marty. on theother hand, we can consider n-ary hypergroups as a good generalization of n-ary groups. we define thefundamental relation β* on an n-ary hypergroup h as the smallest equivalence relation such tha...

When learning a directed acyclic graph (DAG) model via observational data, one generally cannot identify the underlying DAG, but can potentially obtain a Markov equivalence class. The size (the number of DAGs) of a Markov equivalence class is crucial to infer causal effects or to learn the exact causal DAG via further interventions. Given a set of Markov equivalence classes, the distribution of...

Learning the structure of dependence relations between variables is a pervasive issue in statistical literature. A directed acyclic graph (DAG) can represent set conditional independencies, but different DAGs may encode same and are indistinguishable using observational data. Equivalent be collected into classes, each represented by partially known as essential (EG). Structure learning directly...

‎By observing the equivalence of assertions on determining the jump of a‎ ‎function by its differentiated or integrated Fourier series‎, ‎we generalize a‎ ‎previous result of Kvernadze‎, ‎Hagstrom and Shapiro to the whole class of‎ ‎functions of harmonic bounded variation‎. ‎This is achieved without the finiteness assumption on‎ ‎the number of discontinuities‎. ‎Two results on determination of ...

‎‎The equivalence relation isoclinism partitions the class of all pairs of groups‎ ‎into families‎. ‎In this paper‎, ‎a complete classification of the set of all pairs $(G,G')$ is established‏‎,‎ whenever‎ $G$ is a $p$-group of order at most $p^5‎‏$‎ and ‎$p$ is a prime number greater than 3. Moreover‎, ‎the classification of pairs $(H,H')$ for extra special $p$-groups $H$ is also given.

Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of grammars is said to be decidable. Otherwi...