اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMarkov bases for two-way subtable sum problems
147
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It has been well-known that for two-way contingency tables with fixed row sums and column sums the set of square-free moves of degree two forms a Markov basis. However when we impose an additional constraint that the sum of a subtable is also fixed, then these moves do not necessarily form a Markov basis. Thus, in this paper, we show a necessary and sufficient condition on a subtable so that the set of square-free moves of degree two forms a Markov basis.
قيم البحث
اقرأ أيضاً
Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present paper, we
show that if the subtables are either diagonal or triangular, then their toric ideals possess quadratic Groebner bases.
Markov basis for statistical model of contingency tables gives a useful tool for performing the conditional test of the model via Markov chain Monte Carlo method. In this paper we derive explicit forms of Markov bases for change point models and bloc
k diagonal effect models, which are typical block-wise effect models of two-way contingency tables, and perform conditional tests with some real data sets.
To evaluate a fitting of a statistical model to given data, calculating a conditional $p$ value by a Markov chain Monte Carlo method is one of the effective approaches. For this purpose, a Markov basis plays an important role because it guarantees th
e connectivity of the chain for unbiasedness of the estimation, and therefore is investigated in various settings such as incomplete tables or subtable sum constraints. In this paper, we consider the two-way change-point model for the ladder determinantal table, which is an extension of these two previous works. Our main result is based on the theory of Groebner basis for the distributive lattice. We give a numerical example for actual data.
We consider the Graver basis, the universal Groebner basis, a Markov basis and the set of the circuits of a toric ideal. Let $A, B$ be any two of these bases such that $A ot subset B$, we prove that there is no polynomial on the size or on the maxima
l degree of the elements of $B$ which bounds the size or the maximal degree of the elements of $A$ correspondingly.
Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to understand
this cohomology via Grobner bases. Reduced Grobner bases for the ideals $I_{k,n}$ are determined. An application of these bases is given by proving an immersion theorem for Grassmann manifolds $G_{5,n}$, which establishes new immersions for an infinite family of these manifolds.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
