Displaying similar documents to “A comparison of evidential networks and compositional models”

Probabilistic properties of the continuous double auction

Martin Šmíd (2012)

Kybernetika

Similarity:

In this paper we formulate a general model of the continuous double auction. We (recursively) describe the distribution of the model. As a useful by-product, we give a (recursive) analytic description of the distribution of the process of the best quotes (bid and ask).

On solution sets of information inequalities

Nihat Ay, Walter Wenzel (2012)

Kybernetika

Similarity:

We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce structural properties of Bayesian networks, which is important within causal inference.

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system ℋ is star-like with...

Convergence analysis for asymmetric Deffuant-Weisbuch model

Jiangbo Zhang (2014)

Kybernetika

Similarity:

In this paper, we investigate the convergence behavior of the asymmetric Deffuant-Weisbuch (DW) models during the opinion evolution. Based on the convergence of the asymmetric DW model that generalizes the conventional DW model, we first propose a new concept, the separation time, to study the transient behavior during the DW model's opinion evolution. Then we provide an upper bound of the expected separation time with the help of stochastic analysis. Finally, we show relations of the...

n ( n - 2 ) .

Duchet, Pierre (1988)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity: