The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper we analyze the asymptotic behavior of the IPF algorithm for the problem of finding a 2x2x2 contingency table whose pair marginals are all equal to a specified 2x2 table, depending on a parameter. When this parameter lies below a certain threshold the marginal problem has no solution. We show that in this case the IPF has a “period three limit cycle” attracting all positive initial tables, and a bifurcation occur when the parameter crosses the threshold.
The BIPF algorithm is a Markovian algorithm with the purpose of simulating certain probability distributions supported by contingency tables belonging to hierarchical log-linear models. The updating steps of the algorithm depend only on the required expected marginal tables over the maximal terms of the hierarchical model. Usually these tables are marginals of a positive joint table, in which case it is well known that the algorithm is a blocking Gibbs Sampler. But the algorithm makes sense even...
Download Results (CSV)