Conditional independence relations and log-linear models for random matchings

MaRDI QIDQ1046845zbMATH OpenFDO

Authors Villő Csiszár

Publication date 29 December 2009

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

conditional independencelog-linear modelsmatchingrandom permutations

Mathematics Subject Classification ID

Point estimation (62F10) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Generalized linear models (logistic models) (62J12)

Review text

The paper examines the probability distributions on all possible complete matchings in a complete bipartite graph admitting linear ordering for the vertices. To do so the author defines a distribution providing the implicit and explicit parametric description. The derived results are non-trivial for \(n \geq 4\). The author introduces the idea of \(L\)-decomposability and then characterizes random matchings for which the distribution of permutations is \(L\)-decomposable. Characterizations of only strictly positive distributions are given. Later, the author focuses on the log-linear model. He proves that the family of strictly positive bi-decomposable distributions can be written as a log-linear model. The number of free parameters in this family is also examined. Maximum likelihood estimation is discussed from a theoretical perspective. Ordering is also treated as an unknown parameter to be estimated. The results obtained in the paper are mainly theoretical. No real data application is provided, although the author claims for such practical aspects of the derived results.

Recommendations

• Statistical matching based on probabilistic conditional independence
• On the conditional and mixture model approaches for matched pairs
• Marginal log-linear parameterization of conditional independence models
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• On Conditional Independence, Mixing, and Association
• Existence of independent random matching
• A general stochastic matching model on multigraphs

Cited in

(5)

• On the conditional and mixture model approaches for matched pairs
• Mallows and generalized Mallows model for matchings
• Markov bases of conditional independence models for permutations
• scientific article; zbMATH DE number 1918665 (Why is no real title available?)
• When the degree sequence is a sufficient statistic

This page was built for publication: Conditional independence relations and log-linear models for random matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046845)