Fig. 14
From: Path homologies of motifs and temporal network representations
As Fig. 13 indicates, there are 18 windows in the layered representation of the email DCN with \({\tilde{\beta }}_2 > 0\). Here, we show for each instance the corresponding subgraphs on vertices that participate in 2-homology representatives (it turns out in these particular instances that these subgraphs all have only a single weak component). These subgraphs are all very similar to the fully-connected deep feedforward networks (the difference here being that some of the layers are not fully connected, e.g. the graph in row 2, column 2) whose homology was analytically characterized in Chowdhury et al. (2019), and more generally are of the sort that would be encountered in weight-induced filtrations of multilayer perceptrons