Skip to main content


Fig. 4 | EURASIP Journal on Advances in Signal Processing

Fig. 4

From: Sketching for sequential change-point detection

Fig. 4

Illustration of an expander graph with d=2 and c=3. Following coding theory terminology, we call the left variables nodes (there are N such variables), which correspond to the entries of xt, and the right variables parity check nodes (there are M such nodes), which correspond to entries of yt. In a bipartite graph, connections between the variable nodes are not allowed. The adjacency matrix of the bipartite graph corresponds to our A or At

Back to article page