### On the differentiation theorem in metric groups

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

An overview is given of results achieved by F. Matúš on probabilistic conditional independence (CI). First, his axiomatic characterizations of stochastic functional dependence and unconditional independence are recalled. Then his elegant proof of discrete probabilistic representability of a matroid based on its linear representability over a finite field is recalled. It is explained that this result was a basis of his methodology for constructing a probabilistic representation of a given abstract...

Let $P$ be a discrete multidimensional probability distribution over a finite set of variables $N$ which is only partially specified by the requirement that it has prescribed given marginals $\{{P}_{A};\phantom{\rule{4pt}{0ex}}A\in \mathcal{S}\}$, where $\mathcal{S}$ is a class of subsets of $N$ with $\bigcup \mathcal{S}=N$. The paper deals with the problem of approximating $P$ on the basis of those given marginals. The divergence of an approximation $\widehat{P}$ from $P$ is measured by the relative entropy $H\left(P\right|\widehat{P})$. Two methods for approximating $P$ are compared. One of them uses formerly introduced concept of...

In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...

**Page 1**