my problem at the moment is the following. I have a big list of matrices(about 1600). Actually it's adjencency matrices of cliques with varying size(from 2:2 to 5:5). here is example of 2 matrices
first
name1 name2 name3
name1 1 1 1
name2 1 1 1
name3 1 1 1
and second
name4 name5 name6 name7
name4 1 1 1 1
name5 1 1 1 1
name6 1 1 1 1
name7 1 1 1 1
I need to merge this matrices into a bigger one and have something like that:
name1 name2 name3 name4 name5 name6 name7
name1 1 1 1 0 0 0 0
name2 1 1 1 0 0 0 0
name3 1 1 1 0 0 0 0
name4 0 0 0 1 1 1 1
name5 0 0 0 1 1 1 1
name6 0 0 0 1 1 1 1
name7 0 0 0 1 1 1 1
But this is not all. If there are similar clique(like the first one for the example), or another one containing old names, i want its values to be summarized with the values in the big matrix. And get the matrix of following form:
name1 name2 name3 name4 name5 name6 name7
name1 2 2 2 0 0 0 0
name2 2 2 2 0 0 0 0
name3 2 2 2 0 0 0 0
name4 0 0 0 1 1 1 1
name5 0 0 0 1 1 1 1
name6 0 0 0 1 1 1 1
name7 0 0 0 1 1 1 1
I will need these numbers to identify the power of links in my social network.
This problem seems very complicated for me, so i hope i described it clear enough for you :)