14 citations · 18 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.ST2011★ 2 cited
Vine copulas as a mean for the construction of high dimensional probability distribution associated to a Markov Network
Edith Kovacs, Tamas Szantai
Building higher-dimensional copulas is generally recognized as a difficult problem. Regular-vines using bivariate copulas provide a flexible class of high-dimensional dependency mo…
math.PR2011★ 14 cited
Discovering a junction tree behind a Markov network by a greedy algorithm
Tamas Szantai, Edith Kovacs
In an earlier paper we introduced a special kind of k-width junction tree, called k-th order t-cherry junction tree in order to approximate a joint probability distribution. The ap…