We consider inverse nodal problems for the Sturm–Liouville operators on the tree graphs. Can only dense nodes distinguish the tree graphs? In this paper it is shown that the data of dense-nodes uniquely determines the potential (up to a constant) on the tree graphs. This provides interesting results for an open question implied in the paper.

The hierarchical credibility model was introduced, and extended, in the 70s and early 80s. It deals with the estimation of parameters that characterize the nodes of a tree structure. That model is limited, however, by the fact that its parameters are assumed fixed over time. This causes the model's parameter estimates to track the parameters poorly when the latter are subject to variation over time. This paper seeks to remove this limitation by assuming the parameters in question to follow a process akin to a random walk over time, producing an evolutionary hierarchical model. The specific form of the model is compatible with the use of the Kalman filter for parameter estimation and forecasting. The application of the Kalman filter is conceptually straightforward, but the tree structure of the model parameters can be extensive, and some effort is required to retain organization of the updating algorithm. This is achieved by suitable manipulation of the graph associated with the tree. The graph matrix then appears in the matrix calculations inherent in the Kalman filter. A numerical example is included to illustrate the application of the filter to the model.