Figure 2

A sample collection of input graphs and the resulting template graph. (a) A collection $\mathcal{D}$ of m = 4 graphs. Each graph has the same node set V = {A, B, C, D} but different edge set E _i . (b) An edge-weighted graph summarized from $\mathcal{D}$. Weight for an edge e is $fr\left(e,\mathcal{D}\right)$. For example, the edge (A, C) appears in two graphs in $\mathcal{D}$, so, $fr\left(\right(A,C),\mathcal{D})=2/4=0.5$. (c) The template graph for $\mathcal{D}$. Weight for an edge e is $\varphi \left(e\right)=-\mathsf{\text{log}}\left(fr\left(e,\mathcal{D}\right)\right)$. For example, $\varphi \left(\left(A,C\right)\right)=-\mathsf{\text{log}}\left(fr\left(\left(A,C\right),\mathcal{D}\right)\right)=\mathsf{\text{ - }}\mathsf{\text{log}}\left(0.5\right)=0.69$.