This repositry will contain the class definition for network analysis. Initially it will be used to calculate an optimal threshold to generate a binary adjacency matrix. Other, future options may emerge.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

24 lines
735 B

classdef untitled
%using this class it will be posible to get the optimal threshold in
%order to binarize the adjacency matrix
properties
A=[]; % adjacency matrix
Atype='cc'; %alternative: z-score
Aform='full'; %full: full adjacency matrix as list.
%triu: upper triangle listed including diagonal. %symetry is assumed
%tril: lower triangle listed including diagonal. % symetry is assumed
%list: q by 3: each entrie: [strength source target]
end
properties(Constant)
TimeDim=2; %this should be a constant
SubjDim=3; %this should be a constant
end
methods
end
end