Fig. 5
Illustration of the consequence of decomposing a time series of events into blocks of events for relational information structures. Construction of the relational information structure from a discrete consecutive series of events. By decomposing the series of events into two blocks {E1 E2 E3 E4} and {E5 E6 E7 E8} and constructing from each block a dendrogram is equivalent to applying the map \(f: {\theta }_{N}\to {\theta }_{n}\) to two partial node (“question”) configurations.
