Skip to main content
Figure 4 | BMC Neuroscience

Figure 4

From: A few strong connections: optimizing information retention in neuronal avalanches

Figure 4

Sorting a similarity matrix. A, When N avalanches of a given length are compared to each other, their similarity values can be entered in an N × N matrix as shown here. Each row of the matrix corresponds to one avalanche, and each column within that row indicates how similar that avalanche is to another avalanche. Shaded scale bar ranges from 0 to 1, with greatest similarity coded black. In this figure diagonal elements which compare each avalanche to itself produce perfect similarity. Gray and white pixels appear in the off-diagonal regions, indicating intermediate to low similarity. In this unsorted matrix, the order of avalanches along the margins merely reflects their temporal order of appearance in the recording, and no obvious grouping of dark pixels is found. B, Here avalanches are sorted by an algorithm in order of descending similarity. The highest mutual similarity values appear in the upper left of the matrix, as shown by the darkened pixels. Squares may be drawn to separate dark regions from lighter regions, so as to produce groupings of avalanches.

Back to article page