Algorithm for minimal join graph’s randomized synthesis

The problem of algebraic Bayesian network's (ABN) secondary structure construction based on known primary structure was outlined in the ABN's theory. Logic-probabilistic inference can be performed only when secondary structure is a join graph. The algorithm for randomized synthesis of minimal join graph is formulated in the paper. The theorem was proved that the selection of every probable for the ABN's primary structure minimal join graph has positive probability.