ﻻ يوجد ملخص باللغة العربية
We prove the conjecture by Diaconis and Eriksson (2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates. We also give an exhaustive characterization of Markov bases for small r.
We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time $T$, the size of the design matrix is $6 times 3cdot 2^{T-1}$ and the convex hull of its columns is the model polytope. We study the
We derive a Markov basis consisting of moves of degree at most three for two-state toric homogeneous Markov chain model of arbitrary length without parameters for initial states. Our basis consists of moves of degree three and degree one, which alter
Markov chain models are used in various fields, such behavioral sciences or econometrics. Although the goodness of fit of the model is usually assessed by large sample approximation, it is desirable to use conditional tests if the sample size is not
We discuss properties of distributions that are multivariate totally positive of order two (MTP2) related to conditional independence. In particular, we show that any independence model generated by an MTP2 distribution is a compositional semigraphoi
In this paper, we study sparse signal detection problems in Degree Corrected Exponential Random Graph Models (ERGMs). We study the performance of two tests based on the conditionally centered sum of degrees and conditionally centered maximum of degre