I'm looking for a way to do (product moment) graph correlation  
between multiple unlabeled graphs G to Gn. Basically I have 900  
individual samples of a 48x48 adjacency matrix which I've listed as a  
3rd dimension of a single array. So it looks something like [48,48,i]  
where i is each individual subject's adjacency matrix.

If i run the gcor function on any two graphs for example [,,1] & [,, 
2] it returns a single graph correlation value however if I run it  
across the entire 3 dimensional array i get a 48x48 graph correlation  
matrix.

For example it sort of looks like this with the exception that it  
would be 48x48
[ , ,1]
       A     B     C     D     E
A    0     0     0     0     0
B    1     0     0     0     0
C    0     0     0     0     0
D    1     1     0     0     0
E     0     1     0     1     0

[ , ,1]
       A     B     C     D     E
A    0     0     0     0     0
B    1     0     0     0     0
C    0     1     0     0     0
D    1     0     0     0     0
E     0     1     0     0     0

all the way to

[ , ,900]
       A     B     C     D     E
A    0     0     0     0     0
B    1     0     0     0     0
C    0     1     0     0     0
D    1     0     0     0     0
E     0     1     0     0     0



Is there a way to generate a single Pearson's product-moment  
correlation coefficient across all 900 individual adjacency matrices?  
The only way i can think of so far is to create my own function that  
keeps looping graphs pairs using gcor but I am hopeful there is  
something known way to do this in a simpler manner.

I'm also unclear about what the standard nomenclature for this is.  
Sometimes I hear multidimensional Array other times i hear people  
refer to it as a multiple array list. This might help as maybe I'm  
just looking up the wrong thing.

Thanks.

-------------------------------------------------------
Namanh Vu Hoang

Department of Sociology: Undergraduate
hoangnv@uci.edu



	[[alternative HTML version deleted]]

