Thresholding Methods

Global Thresholding

A simple filtering technique is to apply a continuously variable threshold,$\tau$, to the association matrix $A$, so that $A_{i,j}=1$ if $\rho _{i,j}>\tau$, and $A_{i,j}=0$ otherwise.

Fixed Cost

As $\tau$ is continuously variable, it is possible to use this and related filtering techniques to construct binary graphs of arbitrary connection density or topological cost, $0<\kappa <1$, where $\kappa$ is the number of edges in the graph (or non-zero elements in the adjacency matrix) divided by the maximum possible number of edges, $N.(N-1)$.

Back To Main Page

Main Page