ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 2. Find a Markov basis for studying the set X of 2-way tables with a fixed quadratic statistic:

X = {T | ∑

j

Tij = Ri, ∑

i

Tij = Cj and ∑

i,j

(i − 2)( j − 2) Tij = Q}.

For 3 × 4 tables, the matrix that computes the sufficient statistics (i.e. the matrix which represents the log-linear model) is the following:



1 1 1 1 0 0 0 0 0 0 0 00 0 0 0 1 1 1 1 0 0 0 00 0 0 0 0 0 0 0 1 1 1 11 0 0 0 1 0 0 0 1 0 0 00 1 0 0 0 1 0 0 0 1 0 00 0 1 0 0 0 1 0 0 0 1 00 0 0 1 0 0 0 1 0 0 0 11 0 −1 −2 0 0 0 0 −1 0 1 2

.

Polyhedral Cones and Testing.

Observe

Xij = {10|P (Xij |Xij ) = Z−1(θ)i)exij θj }4

Test θi = θ∀i against A · θ ≥ 0 with A fixed.

Example 3. Possible conditions enforced by A · · · θ ≥ 0 are

θ1 ≥ θ2 ≥ · · · ≥ θI

or

θi ≥ θI ∀i.

There should be a nice interaction between statistics and polyhedral combinatorics in this problem.

Compare "Competing" Techniques.

A. Classical Asymptotics B. Edgeworth Corrections C. StatXact D. Sequential Importance Sampling E. Others How do these different techniques for estimating p-values relate to each other? With respect to sequential importance sampling: what are possible multi-way gener-alizations of the Gale-Ryser theorem which gives necessary and sufficient conditions for the existence of a 0 /1 matrix with fixed row and column sums?

Stephen Fienberg

Questions about Odds-Ratios.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.