Tree Based Initialization

Steps involved with numerically initializing the Bayes (Junction) tree from scratch. Steps 1.a., 2.a., etc represent the flow of the overall algorithm. The sub steps 2.a., 2.b, etc represent alternative situations that may occur. Follow a particular subset through each of the stages.

Assumptions

• iterative and asynchronous upward init process triggered

Start with attempting upward initialization of leave clique

1.) try clique up init tryCliqUpInit!

2.a.) - 2.b.) response :needdwnmsg

3.a.) - 3.b.) block at parent till all sibling produce up response

4.a.) - 4.b.) construct down init msg from parent

5.a.) - 5.b.) try cliq down init operation, doCliqAutoInitDown!

6.) response :initialized

7.) do upsolve doCliqInferenceUp!

8.) response :upsolved

9.) progress to parent clique