/
generative.py
1010 lines (965 loc) · 44.9 KB
/
generative.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/home/despoB/mb3152/anaconda/bin/python
import brain_graphs
import os
from igraph import Graph, VertexClustering
import numpy as np
import pandas as pd
from multiprocessing import Pool
from itertools import combinations
import pylab as plt
import seaborn as sns
sns.plt.rcParams['pdf.fonttype'] = 42
from multiprocessing import Pool
import glob
import scipy
from richclub import preserve_strength, RC
from multiprocessing import Pool
import sys
import pickle
import time
import powerlaw
import math
"""
SGE:
qdel -u mb3152
qsub -V -l mem_free=1G -pe threaded 20 -j y -o /home/despoB/mb3152/sge/ -e /home/despoB/mb3152/dynamic_mod/sge/ -N g264_1000 generative.py '264' '1000' '40'
qsub -V -l mem_free=1G -pe threaded 20 -j y -o /home/despoB/mb3152/sge/ -e /home/despoB/mb3152/dynamic_mod/sge/ -N g500_500 generative.py '500' '500' '40'
qsub -V -l mem_free=1G -pe threaded 20 -j y -o /home/despoB/mb3152/sge/ -e /home/despoB/mb3152/dynamic_mod/sge/ -N g1000_50 generative.py '1000' '50' '40'
qsub -V -l mem_free=1G -pe threaded 20 -j y -o /home/despoB/mb3152/sge/ -e /home/despoB/mb3152/dynamic_mod/sge/ -N g2500_25 generative.py '2500' '25' '40'
"""
def get_power_pc(hub='pc'):
data = pd.read_csv('/home/despoB/mb3152/modularity/mmc3.csv')
data['new'] = np.zeros(len(data))
if hub == 'pc':
for x2,y2,z2,pc in zip(data.X2,data.Y2,data.Z2,data.PC):
data.new[data[data.X1==x2][data.Z1==z2][data.Y1==y2].index[0]] = pc
else:
1/0
for roi_num,x,y,z,ap in zip(data.index,data.X1,data.Y1,data.Z1,data.CD):
fill_index = data.new[data.X2==x][data.Y2==y][data.Z2==z]
data.new[fill_index.index.values[0]] = ap
values_dict = data.new.to_dict()
return values_dict
def calculate_node_within_community_betweeness(graph,membership,community):
wcsp = np.zeros((graph.vcount()))
community_nodes = np.where(membership==community)[0]
for node1,node2 in combinations(community_nodes,2):
shortest_path = graph.get_shortest_paths(node1,node2,weights='weight',output ='vpath')[0][1:-1]
wcsp[shortest_path] = wcsp[shortest_path] + 1
return wcsp
def calculate_node_between_community_betweeness(graph,nodes,membership,community):
bcsp = np.zeros((graph.vcount()))
for node1,node2 in combinations(nodes,2):
if membership[node1] == membership[node2]:
continue
shortest_path = graph.get_shortest_paths(node1,node2,weights='weight',output ='vpath')[0][1:-1]
bcsp[shortest_path] = bcsp[shortest_path] + 1
bcsp[membership==community] = 0.0
return bcsp
def generate_initial_edges(graph,node,n_edges,possible_nodes,membership,within):
nodes = []
for n in possible_nodes:
if n == node:
continue
if graph.get_eid(node,n,error=False) != -1:
continue
if membership[n]!=membership[node] and within == False:
nodes.append(n)
if membership[n]==membership[node] and within == True:
nodes.append(n)
for n in nodes:
if within == False:
assert membership[n] != membership[node]
else:
assert membership[n] == membership[node]
assert len(nodes) >= n_edges, 'Not enough nodes in community to create that many edges'
edges = []
while len(edges) < n_edges:
edge = (node,np.random.choice(nodes))
if edge[0] == edge[1]:
continue
if edge in edges:
continue
if (edge[1],edge[0]) in edges:
continue
edges.append(edge)
return edges
def generate_and_add_between_edges(graph,membership,node,bcb,n_between_edges,communities_to_add_to):
# might want to randomlly sample from real data for communities_to_add_to
# get distribution of community strengths for the community this node is in
community_nodes = np.argwhere(membership==membership[node])
communities = np.unique(membership)
node_degree_by_community = np.zeros(len(communities))
for comm_idx,c in enumerate(communities):
comm_total_degree = 0.
for node1 in community_nodes:
for node2 in np.argwhere(np.array(membership)==c).reshape(-1):
eid = graph.get_eid(node1,node2,error=False)
if eid == - 1:
continue
comm_total_degree = comm_total_degree + 1
node_degree_by_community[comm_idx] = comm_total_degree
node_degree_by_community[membership[node]] = 0.0
non_zero = len(node_degree_by_community[node_degree_by_community>0])
if non_zero < communities_to_add_to:
communities_to_add_to = non_zero
node_degree_by_community = node_degree_by_community/sum(node_degree_by_community)
print communities_to_add_to
communities_to_add_to = np.random.choice(communities,size=communities_to_add_to,p=node_degree_by_community,replace=False)
temp_membership = np.array(membership).copy()
for i in enumerate(temp_membership):
if i not in communities_to_add_to:
temp_membership[membership==i] = -1
sorted_bcb = np.argsort(bcb)
sorted_bcb = np.fliplr([sorted_bcb])[0]
nba = 0.
while True:
for node2 in sorted_bcb:
if temp_membership[node2] == -1:
continue
if temp_membership[node] == temp_membership[node2]:
continue
if bcb[node2] == 0.0:
node2 = np.random.choice(np.where(bcb==0.0)[0].reshape(-1))
if graph.get_eid(node,node2,error=False) != -1:
continue
if graph.degree()[node2] == 0.0:
continue
graph = add_edges(graph,[[node,node2]])
nba = nba + 1
if nba >= n_between_edges:
break
if nba >= n_between_edges:
break
return graph
def generate_and_add_within_edges(graph,membership,node,wcb,n_within_edges):
sorted_wcb = np.argsort(wcb)
sorted_wcb = np.fliplr([sorted_wcb])[0]
nwa = 0.
trials = 0.0
while True:
for node2 in sorted_wcb:
if membership[node] != membership[node2]:
continue
if wcb[node2] == 0.0:
node2 = np.random.choice(np.where(wcb==0.0)[0].reshape(-1))
if graph.get_eid(node,node2,error=False) != -1:
continue
if graph.degree()[node2] == 0.0:
continue
graph = add_edges(graph,[[node,node2]])
nwa = nwa + 1
if nwa >= n_within_edges:
break
if nwa >= n_within_edges:
break
if trials > len(sorted_wcb)*10:
1/0
return graph
def add_edges(graph,edges):
for edge in edges:
try:
assert graph.get_eid(edge[0],edge[1],error=False) == -1
graph.add_edge(edge[0],edge[1],weight=1)
except:
print 'Tried to add edge that already exists'
return graph
def calculate_num_edges(density,gammas,n_nodes,n_edges):
# number of total edges in graph at density we select.
# this is the number of edges that should be present, given n_nodes and density.
n_total_edges = np.ceil(((n_nodes*(n_nodes-1.))/2.)*density)
# thus, we have to add the difference between the number present, and the number that would give us the density we want
n_edges = n_total_edges-n_edges
# however, we might have too many edges in the graph already, so let's just go with average
# since we are adding a node, this should cause the density to decrese slightly.
if n_edges < 0.0:
n_edges = np.floor(n_total_edges/float(n_nodes+1))
n_edges = int(n_edges)
n_between_edges = 0
n_within_edges = 0
g = gammas[np.random.randint(0,len(gammas))]
assert sum(g) > 0.0
pr = g/sum(g)
for n in range(n_edges):
choice = np.random.choice([0,1],p=pr)
if choice == 1:
n_within_edges += 1
else:
n_between_edges += 1
return n_between_edges,n_within_edges
def initial_graph(seed_nodes,n_nodes,n_communities,pi,gammas,density=.15):
#make node array for seeds
nodes = np.array(range(seed_nodes))
#make membership
membership = np.zeros(n_nodes)-1
# make inital empty graph
graph = Graph(directed=False)
# add all nodes
graph.add_vertices(range(len(membership)))
# initialize membership
curr_length = 0
for i in range(n_communities):
num_nodes = np.ceil(pi[i]*seed_nodes)
membership[curr_length:curr_length+num_nodes] = i
curr_length += num_nodes
# trick calculate_num_edges
n_edges= int(np.ceil((((seed_nodes-1)*(seed_nodes-2.))/2.)*density))
for node in nodes:
while True:
try:
# given number of nodes in intial graph, and gammas, estimate number of within and between edges for this node.
n_between_edges, n_within_edges = calculate_num_edges(density=density,gammas=gammas,n_nodes=seed_nodes,n_edges=n_edges)
within_edges = generate_initial_edges(graph=graph,node=node,n_edges=n_within_edges,possible_nodes=nodes,membership=membership,within=True)
between_edges = generate_initial_edges(graph=graph,node=node,n_edges=n_between_edges,possible_nodes=nodes,membership=membership,within=False)
graph = add_edges(graph,within_edges)
graph = add_edges(graph,between_edges)
break
except:
print 'Finding new gamma for node in initialization'
return graph,membership
def find_edgeless_nodes(graph):
edgeless_nodes = np.array(graph.degree())
edged_nodes = np.where(edgeless_nodes>0)[0]
edgeless_nodes = np.where(edgeless_nodes==0)[0]
return edgeless_nodes,edged_nodes
def find_new_node(graph,pi,n_communities):
found = False
while found == False:
edgeless_nodes,edged_nodes = find_edgeless_nodes(graph)
node = np.random.choice(edgeless_nodes)
try:
assert node not in edged_nodes
found = True
except:
found = False
return node,np.random.choice(range(n_communities),p=pi)
def get_real_data(density=.2):
gammas = []
matrices = glob.glob('/home/despoB/mb3152/dynamic_mod/matrices/*rfMRI_REST*matrix*')
matrix = np.load(matrices[0])
for m in matrices[1:]:
matrix = np.nansum([matrix,np.load(m)],axis=0)
matrix = matrix/len(matrices)
graph = brain_graphs.matrix_to_igraph(matrix,density,binary=False,check_tri=True,interpolation='midpoint',normalize=False)
graph = graph.community_infomap(edge_weights='weight')
membership = np.array(graph.membership)
for node in range(matrix.shape[0]):
community = membership[node]
community_nodes = np.argwhere(membership==community)
non_community_nodes = np.argwhere(membership!=community)
within = np.ceil(np.sum(matrix[node,community_nodes]))
between = np.ceil(np.sum(matrix[node,non_community_nodes]))
if within + between == 0.0:
continue
gammas.append([between,within])
graph = brain_graphs.brain_graph(graph)
return gammas,graph.pc,graph.wmd
# def get_pi(seed_nodes,n_nodes,density,gammas,equal_community_size):
# """
# caclulate the number of within community edges that each node will have, at most (at least for a random sample 5 times the length of seed_nodes).
# this is important, as we want to make sure we can actually create a graph with the supplied parameters
# for example, if the gamma and density is too high, and communities too small, it is impossible to initialize this graph.
# """
# n_within_edges = []
# # this is the theoretical number of edges present before we add the node.
# n_edges= int(np.ceil((((seed_nodes-1)*(seed_nodes-2.))/2.)*density))
# for n in range(int(seed_nodes*5)):
# n_within_edges.append(np.ceil(calculate_num_edges(density=density,gammas=gammas,n_nodes=seed_nodes,n_edges=n_edges)[1]))
# n_within_edges = np.max(n_within_edges)
# #make sure it will grow all the way. for this we calculate what the largest number of within community edges that might be added.
# n_within_edges_final = []
# # this is the theoretical number of edges present before we add the node.
# n_edges= int(np.ceil((((n_nodes-1)*(n_nodes-2.))/2.)*density))
# for n in range(int(seed_nodes*5)):
# n_within_edges_final.append(np.ceil(calculate_num_edges(density=density,gammas=gammas,n_nodes=n_nodes,n_edges=n_edges)[1]))
# n_within_edges_final = np.max(n_within_edges_final)
# #generate community sizes by making a distribution
# if equal_community_size:
# pi = np.ones(n_communities)/n_communities
# else:
# for i in range(10000):
# pi = np.random.dirichlet(alpha=np.ones(n_communities))
# #make sure all communities have enough nodes to satisfy gamma
# large_enough = 0
# for i in range(len(pi)):
# #calculate the size of the community, assuming it might get rounded down.
# community_size = np.floor(pi[i]*seed_nodes)
# #calculate the number of edges this community can have total
# possible_within_edges = np.floor((community_size*(community_size-1))/2.)
# #ensure that we do not have more within_community edges than possible for community
# if n_within_edges * (community_size+1) < possible_within_edges:
# large_enough += 1
# #calculate the size of the community, assuming it might get rounded down, but now for the whole graph.
# community_size = np.floor(pi[i]*n_nodes)
# #calculate the number of edges this community can have total
# possible_within_edges = np.floor((community_size*(community_size-1))/2.)
# #ensure that we do not have more within_community edges than possible for community
# if n_within_edges_final * (community_size+1) < possible_within_edges:
# large_enough += 1
# if large_enough == n_communities*2:
# break
# assert i < 9999, 'Could not satisfy parameters'
# return pi
# def generative_model_shortest_paths_win(n_nodes=264,n_communities=4,gamma=.95,density=.1,intial_community_density=.1,equal_community_size=False):
# n_nodes=264
# n_communities=8
# density=.05
# intial_community_density=.1
# equal_community_size=False
# """
# Parameters
# n_nodes: number of nodes in final iteration of the graph
# n_communities: number of communities in graph
# gamma: fraction of between and within module edges
# gamma, and its distribution should be extimated on real data. Just get a set of ratios at given density, and randomly choose from it.
# density: fraction of edges that exists relative to complete graph
# intial_community_density: the density of nodes that are added to each community in initialization of graph
# equal_community_size: True, or False if uneven communities are wanted, for which a dirichlet distribution is used.
# Initialization
# Caclulate the number of nodes to modules, according to size, and randomly add edges to match density and gamma
# Generative Growth Model
# 1.
# Compute number of between and within module edges to add, based on density and fraction
# 2.
# within module edge
# for each node, 1 / average shortest path. to power of BETA
# add edges to nodes with most shortest paths through it.
# between module edge
# for each node not in the module, get average shortest path between nodes not in module, but consider paths through module.
# add edges to nodes with most shortest paths through it.
# """
# 1/0
# #intialize graph with number of nodes based on community density, total n_nodes, and n_communities.
# #this ensures that a certain percentage of nodes in each community are present in initalization of graph.
# #for example, an intial_community_density of .2 ensure that each community has twenty percent of its nodes present during initialization
# seed_nodes = np.ceil(intial_community_density *(n_nodes/n_communities))*n_communities
# gammas,pc,wmd = get_real_data(density)
# pi = get_pi(seed_nodes,n_nodes,density,gammas,equal_community_size)
# #pass pi,gammas, and parameters to make graph.
# graph,membership = initial_graph(int(seed_nodes),int(n_nodes),int(n_communities),pi,gammas,density)
# n_nodes_in_graph = len(find_edgeless_nodes(graph)[1])
# assert len(np.unique(membership[membership>=0])) == n_communities
# assert n_nodes_in_graph == seed_nodes, 'Initialization failed, different number of nodes than requested'
# print 'Graph initialized with ' + str(n_nodes_in_graph) + ' nodes and a density of: ' + str(graph.ecount()/((n_nodes_in_graph*(n_nodes_in_graph-1))/2.))
# pr = np.logspace(0,1,n_communities)**3
# pr = pr / sum(pr)
# pr = np.flipud(pr)
# """
# you should make it so that the number of communities the node gets added to is proportional to the between edges
# is there a correlation between sum of PC and efficiency?
# """
# while n_nodes_in_graph < n_nodes:
# if str(n_nodes_in_graph)[-1] == '0':
# print str(n_nodes_in_graph) + str(' nodes, ') + str(graph.ecount()) + ' edges in graph and density of: ' + str(graph.ecount()/((n_nodes_in_graph*(n_nodes_in_graph-1))/2.))
# node,community = find_new_node(graph,pi,n_communities)
# membership[node] = community
# wcb = calculate_node_within_community_betweeness(graph,membership,community)
# bcb = calculate_node_between_community_betweeness(graph,np.argwhere(membership!=-1).reshape(-1),membership,community)
# communities_to_add_to = np.random.choice(range(1,n_communities+1),p=pr)
# n_between_edges, n_within_edges = calculate_num_edges(density,gammas,n_nodes_in_graph+1,graph.ecount())
# generate_and_add_between_edges(graph,membership,node,bcb,n_between_edges,communities_to_add_to)
# generate_and_add_within_edges(graph,membership,node,wcb,n_within_edges)
# print 'adding %s within community edges and %s between community edges' %(n_within_edges,n_between_edges)
# n_nodes_in_graph = len(find_edgeless_nodes(graph)[1])
# brain_graph = brain_graphs.brain_graph(VertexClustering(graph,membership=membership.astype(int)))
# return brain_graphs.brain_graph(VertexClustering(graph, membership=membership.astype(int)))
def calc_num_edges(n_nodes,density):
return np.ceil(((n_nodes*(n_nodes-1.))/2.)*density)
# def make_prs(variables):
# temp_graph=variables[0]
# edge=variables[1]
# orig_q=variables[2]
# orig_sps=variables[3]
# temp_graph.delete_edges(edge)
# if temp_graph.is_connected() == False:
# return [-10000,-10000]
# return [orig_sps-np.sum(temp_graph.shortest_paths()),temp_graph.community_fastgreedy().as_clustering().modularity-orig_q]
def preferential_routing_multi_density(variables):
metric = variables[0]
n_nodes = variables[1]
density = variables[2]
graph = variables[3]
np.random.seed(variables[4])
all_shortest = variables[5]
print variables[4],variables[0]
q_ratio = variables[6]
rccs = []
for idx in range(150):
delete_edges = graph.get_edgelist()
if metric != 'none':
vc = graph.community_fastgreedy().as_clustering()
orig_q = vc.modularity
membership = vc.membership
orig_sps = np.sum(np.array(graph.shortest_paths()))
community_matrix = brain_graphs.community_matrix(membership,0)
np.fill_diagonal(community_matrix,1)
orig_bc_sps = np.sum(np.array(graph.shortest_paths())[community_matrix!=1])
q_edge_scores = []
sps_edge_scores = []
for edge in delete_edges:
eid = graph.get_eid(edge[0],edge[1],error=False)
graph.delete_edges(eid)
q_edge_scores.append(VertexClustering(graph,membership).modularity-orig_q)
if all_shortest == 'all':
sps_edge_scores.append(orig_sps-np.sum(np.array(graph.shortest_paths())))
if all_shortest == 'bc':
sps_edge_scores.append(orig_bc_sps-np.sum(np.array(graph.shortest_paths())[community_matrix!=1]))
graph.add_edge(edge[0],edge[1],weight=1)
q_edge_scores = np.array(q_edge_scores)#Q when edge removed - original Q. High means increase in Q when edge removed.
sps_edge_scores = np.array(sps_edge_scores)#original sps minus sps when edge removed. Higher value means more efficient.
if len(np.unique(sps_edge_scores)) > 1:
q_edge_scores = scipy.stats.zscore(scipy.stats.rankdata(q_edge_scores,method='min'))
sps_edge_scores = scipy.stats.zscore(scipy.stats.rankdata(sps_edge_scores,method='min'))
scores = (q_edge_scores*q_ratio) + (sps_edge_scores*(1-q_ratio))
else:
scores = scipy.stats.rankdata(q_edge_scores,method='min')
if metric == 'q':
edges = np.array(delete_edges)[np.argsort(scores)][int(-(graph.ecount()*.05)):]
edges = np.array(list(edges)[::-1])
if metric == 'none':
scores = np.random.randint(0,100,(int(graph.ecount()*.05))).astype(float)
edges = np.array(delete_edges)[np.argsort(scores)]
for edge in edges:
eid = graph.get_eid(edge[0],edge[1],error=False)
graph.delete_edges(eid)
if graph.is_connected() == False:
graph.add_edge(edge[0],edge[1],weight=1)
continue
while True:
i = np.random.randint(0,n_nodes)
j = np.random.randint(0,n_nodes)
if i == j:
continue
if graph.get_eid(i,j,error=False) == -1:
graph.add_edge(i,j,weight=1)
break
sys.stdout.flush()
vc = brain_graphs.brain_graph(graph.community_fastgreedy().as_clustering())
pc = vc.pc
pc[np.isnan(pc)] = 0.0
pc_emperical_phis = RC(graph,scores=pc).phis()
pc_average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=pc).phis() for i in range(25)],axis=0)
pc_normalized_phis = pc_emperical_phis/pc_average_randomized_phis
degree_emperical_phis = RC(graph, scores=graph.strength(weights='weight')).phis()
average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=graph.strength(weights='weight')).phis() for i in range(25)],axis=0)
degree_normalized_phis = degree_emperical_phis/average_randomized_phis
rcc = pc_normalized_phis[-10:]
if np.isfinite(np.nanmean(rcc)):
rccs.append(np.nanmean(rcc))
return [metric,pc_normalized_phis,degree_normalized_phis,graph]
# def preferential_routing_multi(variables):
# metric = variables[0]
# n_nodes = variables[1]
# density = variables[2]
# graph = variables[3]
# np.random.seed(variables[4])
# all_shortest = variables[5]
# print variables[4],variables[0]
# q_ratio = variables[6]
# while True:
# delete_edges = graph.get_edgelist()
# if metric != 'none':
# vc = graph.community_fastgreedy().as_clustering()
# orig_q = vc.modularity
# membership = vc.membership
# orig_sps = np.sum(np.array(graph.shortest_paths()))
# community_matrix = brain_graphs.community_matrix(membership,0)
# np.fill_diagonal(community_matrix,1)
# orig_bc_sps = np.sum(np.array(graph.shortest_paths())[community_matrix!=1])
# q_edge_scores = []
# sps_edge_scores = []
# for edge in delete_edges:
# eid = graph.get_eid(edge[0],edge[1],error=False)
# graph.delete_edges(eid)
# q_edge_scores.append(VertexClustering(graph,membership).modularity-orig_q)
# if all_shortest == 'all':
# sps_edge_scores.append(orig_sps-np.sum(np.array(graph.shortest_paths())))
# if all_shortest == 'bc':
# sps_edge_scores.append(orig_bc_sps-np.sum(np.array(graph.shortest_paths())[community_matrix!=1]))
# graph.add_edge(edge[0],edge[1],weight=1)
# q_edge_scores = np.array(q_edge_scores)
# sps_edge_scores = np.array(sps_edge_scores)
# if len(np.unique(sps_edge_scores)) > 1:
# q_edge_scores = scipy.stats.zscore(scipy.stats.rankdata(q_edge_scores,method='min'))
# sps_edge_scores = scipy.stats.zscore(scipy.stats.rankdata(sps_edge_scores,method='min'))
# scores = (q_edge_scores*q_ratio) + (sps_edge_scores*(1-q_ratio))
# else:
# scores = scipy.stats.rankdata(q_edge_scores,method='min')
# scores = scores.astype(int)
# if metric == 'q':
# edges = np.array(delete_edges)[np.argsort(scores)][int(-(graph.ecount()*.05)):]
# edges = np.array(list(edges)[::-1])
# if metric == 'none':
# scores = np.random.randint(0,100,(int(graph.ecount()*.05))).astype(float)
# edges = np.array(delete_edges)[np.argsort(scores)]
# for edge in edges:
# eid = graph.get_eid(edge[0],edge[1],error=False)
# graph.delete_edges(eid)
# if graph.is_connected() == False:
# graph.add_edge(edge[0],edge[1],weight=1)
# if graph.density() <= density:
# break
# if graph.density() <= density:
# break
# sys.stdout.flush()
# vc = brain_graphs.brain_graph(graph.community_fastgreedy().as_clustering())
# pc = vc.pc
# pc[np.isnan(pc)] = 0.0
# pc_emperical_phis = RC(graph,scores=pc).phis()
# pc_average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=pc).phis() for i in range(25)],axis=0)
# pc_normalized_phis = pc_emperical_phis/pc_average_randomized_phis
# degree_emperical_phis = RC(graph, scores=graph.strength(weights='weight')).phis()
# average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=graph.strength(weights='weight')).phis() for i in range(25)],axis=0)
# degree_normalized_phis = degree_emperical_phis/average_randomized_phis
# return [metric,pc_normalized_phis,degree_normalized_phis,graph]
def small_rich_clubs():
n_nodes = 1000
density = .10
rcs = []
d_rcs = []
mods = []
x = ((density/2.)*n_nodes)
for i in range(10):
i = i * 10
graph=Graph.Watts_Strogatz(1,n_nodes,int(np.around(x)),i*0.01)
graph.es["weight"] = np.ones(graph.ecount())
vc = brain_graphs.brain_graph(graph.community_fastgreedy().as_clustering())
pc = vc.pc
pc[np.isnan(pc)] = 0.0
pc_emperical_phis = RC(graph,scores=pc).phis()
pc_average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=pc).phis() for i in range(25)],axis=0)
pc_normalized_phis = pc_emperical_phis/pc_average_randomized_phis
rcs.append(pc_normalized_phis[int(graph.vcount()*.8):int(graph.vcount()*.9)])
mods.append(vc.community.modularity)
degree_emperical_phis = RC(graph, scores=graph.strength(weights='weight')).phis()
average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=graph.strength(weights='weight')).phis() for i in range(25)],axis=0)
degree_normalized_phis = degree_emperical_phis/average_randomized_phis
d_rcs.append(degree_normalized_phis[int(graph.vcount()*.8):int(graph.vcount()*.9)])
def make_graph(variables):
n_nodes = variables[0]
np.random.seed(variables[1])
graph = Graph()
graph.add_vertices(n_nodes)
while True:
i = np.random.randint(0,n_nodes)
j = np.random.randint(0,n_nodes)
if i == j:
continue
if graph.get_eid(i,j,error=False) == -1:
graph.add_edge(i,j,weight=1)
if graph.density() > .05 and graph.is_connected() == True:
break
graph.es["weight"] = np.ones(graph.ecount())
return graph
def make_mod_graph(variables):
n_nodes = variables[0]
np.random.seed(variables[1])
graph = Graph()
graph.add_vertices(n_nodes)
n_communities = 10
membership = np.random.randint(0,n_communities,n_nodes)
bucket = np.zeros(n_communities).astype(bool)
bucket[0:5] = True
between = np.random.choice(bucket,1)[0]
while True:
i = np.random.randint(0,n_nodes)
j = np.random.randint(0,n_nodes)
if i == j:
continue
if graph.get_eid(i,j,error=False) == -1:
if between == False:
if membership[i] == membership[j]:
graph.add_edge(i,j,weight=1)
between = np.random.choice(bucket,1)[0]
continue
if between == True:
if membership[i] != membership[j]:
graph.add_edge(i,j,weight=1)
between = np.random.choice(bucket,1)[0]
continue
if graph.density() > .05 and graph.is_connected() == True:
break
graph.es["weight"] = np.ones(graph.ecount())
return graph
def make_small_world(variables):
density = variables[1]
n_nodes = variables[0]
x = ((density/2.)*n_nodes)
graph=Graph.Watts_Strogatz(1,n_nodes,int(np.around(x)),0.5)
graph.es["weight"] = np.ones(graph.ecount())
return graph
def preferential_routing(n_nodes=300,iters=100,cores=40,all_shortest='all',q_ratio=.9):
if n_nodes == 100:
density= 0.05
if n_nodes == 200:
density = 0.025
if n_nodes == 264:
density = 0.02
if n_nodes == 300:
density = 0.015
pool = Pool(cores)
none_deg_rc = []
none_pc_rc = []
none_graphs = []
both_deg_rc = []
both_pc_rc = []
both_graphs = []
variables = []
for i in range(iters):
variables.append([n_nodes,i])
graphs = pool.map(make_graph,variables)
variables = []
for i,g in enumerate(graphs):
variables.append(['none',n_nodes,density,g.copy(),i,all_shortest,q_ratio])
for i,g in enumerate(graphs):
variables.append(['q',n_nodes,density,g.copy(),i,all_shortest,q_ratio])
sys.stdout.flush()
results = pool.map(preferential_routing_multi_density,variables)
for r in results:
if r[0] == 'none':
none_pc_rc.append(r[1])
none_deg_rc.append(r[2])
none_graphs.append(r[3])
else:
both_pc_rc.append(r[1])
both_deg_rc.append(r[2])
both_graphs.append(r[3])
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_none_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'w+') as f:
pickle.dump(none_graphs,f)
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'w+') as f:
pickle.dump(both_graphs,f)
np.save('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_pc_none_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio),np.array(none_pc_rc))
np.save('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_deg_none_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio),np.array(none_deg_rc))
np.save('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_pc_both_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio),np.array(both_pc_rc))
np.save('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_deg_both_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio),np.array(both_deg_rc))
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_none_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
none_graphs = pickle.load(f)
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
both_graphs = pickle.load(f)
none_mods = []
for g in none_graphs:
none_mods.append(g.community_fastgreedy().as_clustering().modularity)
both_mods = []
for g in both_graphs:
both_mods.append(g.community_fastgreedy().as_clustering().modularity)
print 'Q results, real | random'
print 'means: ', scipy.stats.ttest_ind(both_mods,none_mods)
print 't_test:', np.mean(both_mods),np.mean(none_mods)
none_mods = []
for g in none_graphs:
none_mods.append(np.sum(g.shortest_paths()))
both_mods = []
for g in both_graphs:
both_mods.append(np.sum(g.shortest_paths()))
print 'SP results, real | random'
print 'means: ', scipy.stats.ttest_ind(both_mods,none_mods)
print 't_test:', np.mean(both_mods),np.mean(none_mods)
def all_shortest_vs_bc():
iters = 1000
n_nodes = 100
with open('/home/despoB/mb3152/dynamic_mod/results/rich_club_gen_graphs_both_%s_%s_False'%(iters,n_nodes),'r') as f:
bc_graphs = pickle.load(f)
with open('/home/despoB/mb3152/dynamic_mod/results/rich_club_gen_graphs_both_%s_%s_True'%(iters,n_nodes),'r') as f:
all_graphs = pickle.load(f)
none_mods = []
for g in all_graphs:
none_mods.append(np.sum(g.shortest_paths()))
both_mods = []
for g in bc_graphs:
both_mods.append(np.sum(g.shortest_paths()))
print scipy.stats.ttest_ind(both_mods,none_mods)
print np.mean(both_mods),np.mean(none_mods)
def known_graphs():
iters = 100
pc_rc = []
deg_rc = []
for i in range(iters):
while True:
# graph=Graph.Watts_Strogatz(1,1000,3,0.25)
graph = Graph.Barabasi(1000,3,implementation="psumtree")
graph.es["weight"] = np.ones(graph.ecount())
if graph.is_connected() == True:
break
n_nodes = graph.vcount()
vc = brain_graphs.brain_graph(graph.community_fastgreedy().as_clustering())
pc = vc.pc
pc[np.isnan(pc)] = 0.0
pc_emperical_phis = RC(graph,scores=pc).phis()
pc_average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=pc).phis() for i in range(5)],axis=0)
pc_normalized_phis = pc_emperical_phis/pc_average_randomized_phis
degree_emperical_phis = RC(graph, scores=graph.strength(weights='weight')).phis()
average_randomized_phis = np.nanmean([RC(preserve_strength(graph,randomize_topology=True),scores=graph.strength(weights='weight')).phis() for i in range(5)],axis=0)
degree_normalized_phis = degree_emperical_phis/average_randomized_phis
pc_rc.append(np.nanmean(pc_normalized_phis[int(n_nodes*.75):int(n_nodes*.9)]))
deg_rc.append(np.nanmean(degree_normalized_phis[int(n_nodes*.75):int(n_nodes*.9)]))
print scipy.stats.ttest_ind(pc_rc,deg_rc)
def analyze_param_results():
n_nodes = 100
iters = 100
all_shortest = 'all'
real_degree,real_pc = get_real_degree(0.05)
real_degree = np.array(real_degree)
real_degree = real_degree[real_degree>0]
real_pc = np.array(real_pc)
real_pc[np.isnan(real_pc)] = 0.0
df = pd.DataFrame(columns = ['Model','Variable','Q_SP Ratio','Value'])
mean_df = pd.DataFrame(columns = ['Model','Variable','Q_SP Ratio','Value'])
for q_ratio in np.arange(50,101)*0.01:
pc_graphs = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio))
pc_both = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_pc_both_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio))
sp = []
bcsp = []
mod = []
dd_fit = []
pc = []
pc_rc = []
for i,g in enumerate(pc_graphs):
vc = g.community_fastgreedy().as_clustering()
v = brain_graphs.brain_graph(vc)
p = np.array(v.pc)
community_matrix = brain_graphs.community_matrix(vc.membership,0)
theshort = np.array(g.shortest_paths())
sp.append(np.sum(theshort))
bcsp.append(np.sum(theshort[community_matrix!=1]))
mod.append(vc.modularity)
pc.append(scipy.stats.entropy(np.histogram(p,10)[0],np.histogram(np.array(real_pc),10)[0]))
pc_rc.append(np.nanmean(pc_both[i,int(n_nodes*.85):int(n_nodes*.9)]))
dd_fit.append(scipy.stats.entropy(np.histogram(g.degree(),10)[0],np.histogram(np.array(real_degree),10)[0]))
mean_df = mean_df.append({'Variable':'Efficiency','Q_SP Ratio':q_ratio,'Value':np.nanmean(sp)*-1},ignore_index=True)
mean_df = mean_df.append({'Variable':'Between Community Efficiency','Q_SP Ratio':q_ratio,'Value':np.nanmean(bcsp)*-1},ignore_index=True)
mean_df = mean_df.append({'Variable':'Q','Q_SP Ratio':q_ratio,'Value':np.nanmean(mod)},ignore_index=True)
mean_df = mean_df.append({'Variable':'Degree Distribution Fit','Q_SP Ratio':q_ratio,'Value':np.nanmean(dd_fit)*-1},ignore_index=True)
mean_df = mean_df.append({'Variable':'PC Fit','Q_SP Ratio':q_ratio,'Value':np.nanmean(pc)*-1},ignore_index=True)
mean_df = mean_df.append({'Variable':'RCC','Q_SP Ratio':q_ratio,'Value':np.nanmean(pc_rc)},ignore_index=True)
for s,i,j,k,l,m,n in zip(range(0,100),sp,bcsp,mod,dd_fit,pc,pc_rc):
df = df.append({'Model':s,'Variable':'Efficiency','Q_SP Ratio':q_ratio,'Value':i*-1},ignore_index=True)
df = df.append({'Model':s,'Variable':'Between Community Efficiency','Q_SP Ratio':q_ratio,'Value':j*-1},ignore_index=True)
df = df.append({'Model':s,'Variable':'Q','Q_SP Ratio':q_ratio,'Value':k},ignore_index=True)
df = df.append({'Model':s,'Variable':'Degree Distribution Fit','Q_SP Ratio':q_ratio,'Value':l*-1},ignore_index=True)
df = df.append({'Model':s,'Variable':'PC Fit','Q_SP Ratio':q_ratio,'Value':m*-1},ignore_index=True)
df = df.append({'Model':s,'Variable':'RCC','Q_SP Ratio':q_ratio,'Value':n},ignore_index=True)
df['Value'][df.Variable=='RCC'][np.isfinite(df['Value'][df.Variable=='RCC'])==False] = np.nan
df = df.dropna()
params = ['Efficiency','Between Community Efficiency','Q','Degree Distribution Fit','PC Fit', 'RCC']
g = sns.FacetGrid(df,col='Variable',sharex=False, sharey=False,col_wrap=3)
for param,ax,c in zip(params,g.axes.reshape(-1),sns.color_palette()):
d = np.zeros((100,51))
temp_df = df[df.Variable==param].copy()
for i, q_ratio in enumerate(np.arange(50,101)*0.01):
d[:,i] = temp_df.Value[temp_df['Q_SP Ratio']==q_ratio].values
sns.tsplot(d,np.arange(50,101)*0.01,ax=ax,color =c,ci=95)
ax.set_title(param)
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/multi_parameter_figure_new.pdf')
sns.plt.show()
sns.plt.close()
# ax.figure.set_size_inches(*args, **kwargs)
def normalize(df,col_name,val_name):
norm_df = df.copy()
for feature_name in np.unique(df['%s'%(col_name)]):
norm_df[val_name][norm_df[col_name]==feature_name] = scipy.stats.zscore(df[val_name][df[col_name]==feature_name])
return norm_df
norm_df = normalize(df,'Variable','Value')
sns.tsplot(data=norm_df,time='Q_SP Ratio',unit='Model',condition='Variable',value='Value')
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/parameter_figure_new.pdf')
sns.plt.show()
def analyze_results(q_ratio=.75):
real_degree,real_pc = get_real_degree(0.05)
real_degree = np.array(real_degree)
real_pc = np.array(real_pc)
real_degree = real_degree[real_degree>0]
real_pc = real_pc[real_pc>=0]
n_nodes = 100
iters = 1000
all_shortest = 'all'
percent = .95
deg_both = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_deg_both_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio))
pc_both = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_pc_both_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio))
none_pc = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_pc_none_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio))
none_deg = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_deg_none_%s_%s_%s_%s.npy'%(iters,n_nodes,all_shortest,q_ratio))
pc_graphs = np.load('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio))
idx = idx = np.zeros(shape=len(pc_graphs)).astype(bool)
pcs = []
for i in range(len(pc_graphs)):
g = pc_graphs[i]
vc = g.community_fastgreedy().as_clustering()
v = brain_graphs.brain_graph(vc)
p = np.array(v.pc)
if len(p[p>0]) >= 10:
idx[i] = True
pcs.append(p)
# print scipy.stats.entropy(np.histogram(p,10)[0],np.histogram(np.array(real_pc),10)[0])
# print scipy.stats.ttest_ind(pc_both[idx,(int(n_nodes*percent))],none_pc[:,(int(n_nodes*percent))])
# print np.nanmean(pc_both[idx,int(n_nodes*percent)])
sns.set_style("white")
sns.set_style("ticks")
ax1 = sns.tsplot(pc_both[idx,:int(n_nodes*percent)],color='black',condition='PC_Q',ci=95)
ax2 = sns.tsplot(deg_both[:,:int(n_nodes*percent)],color='yellow',condition='Deg_Q',ci=95)
ax3 = sns.tsplot(none_pc[:,:int(n_nodes*percent)],color='red',condition='PC_None',ci=95)
ax4 = sns.tsplot(none_deg[:,:int(n_nodes*percent)],color='blue',condition='Deg_None',ci=95)
sns.plt.legend(loc='upper left')
sns.plt.ylabel('Normalized Rich Club Coefficeint')
sns.plt.xlabel('Rank')
otherax = ax1.twinx()
# otherax.plot(scipy.stats.ttest_ind(pc_both,none_pc)[0],color='green',label='T Score')
otherax.plot(scipy.stats.ttest_ind(pc_both[:,:int(n_nodes*percent)],none_pc[:,:int(n_nodes*percent)])[0],color='green',label='T Score')
sns.plt.legend()
sns.plt.xlim(0,int(n_nodes*percent))
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/%s_%s_%s_%s_generative_new.pdf'%(n_nodes,iters,all_shortest,q_ratio),dpi=1000)
sns.plt.show()
bins = 10
sns.plt.hist(np.array(pcs).reshape(-1),histtype='stepfilled',normed=True,alpha=0.35,color='yellow',label='Model',stacked=True,bins=bins)
sns.plt.hist(real_pc,histtype='stepfilled',normed=True,alpha=0.35,color='blue',label='Real',stacked=True,bins=bins)
sns.plt.show()
def dd_fit():
iters = 1000
n_nodes = 100
all_shortest = 'all'
q_ratio = .75
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_none_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
none_graphs = pickle.load(f)
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
both_graphs = pickle.load(f)
both_dd = []
none_dd = []
for g in both_graphs:
both_dd.append(powerlaw.Fit(g.degree()).distribution_compare('power_law','exponential')[0])
for g in none_graphs:
none_dd.append(powerlaw.Fit(g.degree()).distribution_compare('power_law','exponential')[0])
print scipy.stats.ttest_ind(both_dd,none_dd)
df = pd.DataFrame(np.array([both_dd,none_dd]).transpose(),columns=['Model','Random'])
sns.violinplot(df,inner='quartile')
sns.plt.title('Power Law Fit')
sns.plt.legend()
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/%s_%s_%s_%s_powerfit.pdf'%(n_nodes,iters,all_shortest,q_ratio),dpi=1000)
sns.plt.show()
def analyze_sps(n_nodes=100,iters=5000):
with open('/home/despoB/mb3152/dynamic_mod/results/rich_club_gen_graphs_none_%s_%s'%(iters,n_nodes),'r') as f:
none_graphs = pickle.load(f)
with open('/home/despoB/mb3152/dynamic_mod/results/rich_club_gen_graphs_both_%s_%s'%(iters,n_nodes),'r') as f:
both_graphs = pickle.load(f)
none_mods = []
for g in none_graphs:
vc = g.community_fastgreedy().as_clustering()
orig_q = vc.modularity
membership = vc.membership
community_matrix = brain_graphs.community_matrix(membership,0)
community_matrix = np.fill_diagonal(community_matrix,1)
none_mods.append(np.sum(np.array(g.shortest_paths())[community_matrix!=1]))
both_mods = []
for g in both_graphs:
vc = g.community_fastgreedy().as_clustering()
orig_q = vc.modularity
membership = vc.membership
community_matrix = brain_graphs.community_matrix(membership,0)
community_matrix = np.fill_diagonal(community_matrix,1)
both_mods.append(np.sum(np.array(g.shortest_paths())[community_matrix!=1]))
print scipy.stats.ttest_ind(both_mods,none_mods)
def get_real_degree(density=.05):
try: matrix = np.load('/home/despoB/mb3152/dynamic_mod/graph_for_gen_compare.npy')
except:
matrices = glob.glob('/home/despoB/mb3152/dynamic_mod/matrices/**power*rfMRI_REST*matrix*')
matrix = np.zeros((264,264,len(matrices)))
for i,m in enumerate(matrices):
m = np.load(m)
np.fill_diagonal(m,0.0)
m[np.isnan(m)] = 0
m = np.arctanh(m)
m[np.isfinite(m) == False] = np.nan
matrix[:,:,i] = m
matrix = np.nanmean(matrix,axis=2)
np.save('/home/despoB/mb3152/dynamic_mod/graph_for_gen_compare.npy',matrix)
graph = brain_graphs.matrix_to_igraph(matrix,density,binary=False,check_tri=True,interpolation='midpoint',normalize=False)
vc = graph.community_fastgreedy().as_clustering()
v = brain_graphs.brain_graph(vc)
pc = np.array(v.pc)
return graph.strength(weights='weight'),pc
def plt_dd_fit():
iters = 1000
n_nodes = 100
q_ratio = .75
all_shortest = 'all'
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_none_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
none_graphs = pickle.load(f)
with open('/home/despoB/mb3152/dynamic_mod/results/new_gen_results/rich_club_gen_graphs_both_%s_%s_%s_%s'%(iters,n_nodes,all_shortest,q_ratio),'r') as f:
both_graphs = pickle.load(f)
none_pcs = []
none_mods = []
for g in none_graphs:
none_mods.append(g.degree())
vc = g.community_fastgreedy().as_clustering()
v = brain_graphs.brain_graph(vc)
none_pcs.append(v.pc)
both_pcs = []
both_mods = []
for g in both_graphs:
both_mods.append(g.degree())
none_mods.append(g.degree())
vc = g.community_fastgreedy().as_clustering()
v = brain_graphs.brain_graph(vc)
both_pcs.append(v.pc)
real_degree,real_pc = get_real_degree(0.05)
real_degree = np.array(real_degree)
real_pc= np.array(real_pc)
real_degree = real_degree[real_degree>0]
real_pc= real_pc[real_pc>0]
model_fits = []
random_fits = []
for g in both_graphs:
model_fits.append(scipy.stats.entropy(np.histogram(g.degree(),10)[0],np.histogram(np.array(real_degree),10)[0]))
for g in none_graphs:
random_fits.append(scipy.stats.entropy(np.histogram(g.degree(),10)[0],np.histogram(np.array(real_degree),10)[0]))
print 'degree', scipy.stats.ttest_ind(model_fits,random_fits)
model_fits = []
random_fits = []
for i in range(len(both_graphs)):
model_fits.append(scipy.stats.entropy(np.histogram(both_pcs[i],10)[0],np.histogram(np.array(real_pc),10)[0]))
random_fits.append(scipy.stats.entropy(np.histogram(none_pcs[i],10)[0],np.histogram(np.array(real_pc),10)[0]))
print 'pc', scipy.stats.ttest_ind(model_fits,random_fits)
bins = 10
sns.set_style('white')
fig = sns.plt.figure()
sns.plt.hist(np.array(both_pcs).reshape(-1),histtype='stepfilled',normed=True,alpha=0.35,color='blue',label='Model',stacked=True,bins=bins)
sns.plt.legend()
sns.plt.xlabel('Degree')
sns.plt.ylabel('Normed Count')
ax2 = fig.axes[0].twiny()
ax2.hist(real_pc,histtype='stepfilled',normed=True,alpha=0.35,color='black',label='Real Data',stacked=True,bins=bins)
sns.plt.legend(loc=2)
sns.plt.ylim(-0.01)
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/pc_compare_model_real_%s_%s_%s_%s.pdf'%(n_nodes,iters,all_shortest,q_ratio))
sns.plt.show()
bins = 10
sns.set_style('white')
fig = sns.plt.figure()
sns.plt.hist(np.array(none_pcs).reshape(-1),histtype='stepfilled',normed=True,alpha=0.35,color='yellow',label='Random',stacked=True,bins=bins)
sns.plt.legend()
sns.plt.xlabel('Degree')
sns.plt.ylabel('Normed Count')
ax2 = fig.axes[0].twiny()
ax2.hist(real_pc,histtype='stepfilled',normed=True,alpha=0.35,color='black',label='Real Data',stacked=True,bins=bins)
sns.plt.legend(loc=2)
sns.plt.ylim(-0.01)
sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/pc_compare_random_real_%s_%s_%s_%s.pdf'%(n_nodes,iters,all_shortest,q_ratio))
sns.plt.show()
# sns.set_style('white')
# fit = powerlaw.Fit(np.array(both_mods).reshape(-1))
# fig = fit.plot_ccdf(label="Model",color='y')
# ax1 = fit.power_law.plot_ccdf(ax=fig, color='r', linestyle='--', label='Power law fit')
# fig.set_ylabel(r"$p(X\geq x)$")
# fig.set_xlabel(r"Degree")
# handles, labels = fig.get_legend_handles_labels()
# fig.legend(handles, labels, loc=3)
# sns.plt.savefig('/home/despoB/mb3152/dynamic_mod/figures/model_dfit_%s_%s_%s_%s.pdf'%(n_nodes,iters,all_shortest,q_ratio))
# sns.plt.show()
# sns.set_style('white')
# fit = powerlaw.Fit(np.array(real_degree).reshape(-1))
# fig = fit.plot_ccdf(label="Human Data",color='y')