Mercurial > hg > camir-aes2014

annotate core/magnatagatune/macro_sim_graph_analysis.m @ 0:e9a9cd732c1e tip

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
first hg version after svn
author wolffd
date Tue, 10 Feb 2015 15:05:51 +0000
parents
children
rev   line source
wolffd@0 1
wolffd@0 2 % Results:
wolffd@0 3 Gcomp = ClipComparedGraph(comparison, comparison_ids)
wolffd@0 4 [Gcompcomps] = Gcomp.connected_components();
wolffd@0 5 % only 2graphs with 7 nodes, all subtriplets just connect via
wolffd@0 6 % one node -> no "infestation" of other triplets
wolffd@0 7
wolffd@0 8 G = ClipSimGraph(comparison, comparison_ids)
wolffd@0 9 [Gs,s, id] = G.all_strongly_connected_components();
wolffd@0 10 u = hist(s);
wolffd@0 11 % 179 cycled triplets in unprepared graph
wolffd@0 12
wolffd@0 13 Gmd = ClipSimGraphMD(comparison, comparison_ids)
wolffd@0 14 [Gsmd, smd, id] = Gmd.all_strongly_connected_components();
wolffd@0 15 Gsmd(1).order;
wolffd@0 16 % Not a single triple cycle found
wolffd@0 17
wolffd@0 18 % ---
wolffd@0 19 % analysis on compliance with stobers preprocessing
wolffd@0 20 % trying to find out the differing ? Graph structures
wolffd@0 21 % for that sake analysis with connected (no cycles) components
wolffd@0 22 % ---
wolffd@0 23 Graw = ClipSimGraph(comparison, comparison_ids);
wolffd@0 24 [Gsraw, sraw] = connected_components(Graw)
wolffd@0 25 hist(sraw)
wolffd@0 26 % in the unedited graph, there are 346 connected triplets
wolffd@0 27
wolffd@0 28 Gm = ClipSimGraphMulti(comparison, comparison_ids);
wolffd@0 29 [Gsraw2, sraw2] = connected_components(Gm)
wolffd@0 30 u = hist(sraw2)
wolffd@0 31 % in this unedited graph, there are still 346 connected triplets
wolffd@0 32
wolffd@0 33 Gm.remove_cycles_length2;
wolffd@0 34 [Gs, s, id] = connected_components(DiGraph(Gm));
wolffd@0 35 u = hist(s)
wolffd@0 36 % 27 single nodes, 337 three-node graphs. why not two-nodes
wolffd@0 37
wolffd@0 38 % which clips do these belong to?
wolffd@0 39 soloid = find(s == 1);
wolffd@0 40 soloclips = [];
wolffd@0 41 for i = 1:numel(soloid)
wolffd@0 42 tmpG = ClipSimGraph(Gs(soloid(i)));
wolffd@0 43
wolffd@0 44 % get the clisp of the single node
wolffd@0 45 [sm, bg] = tmpG.clipsN(tmpG.nodes);
wolffd@0 46 soloclips = [soloclips sm bg];
wolffd@0 47 end
wolffd@0 48 soloclips = unique(soloclips)
wolffd@0 49 % exactly 27 clips lost
wolffd@0 50
wolffd@0 51 % now with our graph processing
wolffd@0 52 Gmd = ClipSimGraphMD(comparison, comparison_ids)
wolffd@0 53 [Gsmd, smd] = connected_components(Gmd)
wolffd@0 54 % same result,
wolffd@0 55
wolffd@0 56 % ---
wolffd@0 57 % now which are the orphaned nodes ?
wolffd@0 58 % ---
wolffd@0 59 Go = Gm.unconnected_subgraph();
wolffd@0 60 Go.label(Go.nodes)
wolffd@0 61
wolffd@0 62 % ---
wolffd@0 63 % how many clips are completely lost?
wolffd@0 64 % ---
wolffd@0 65 Go = ClipSimGraphMulti(Gm.unconnected_subgraph());
wolffd@0 66 Go.clips
wolffd@0 67 numel(ans)
wolffd@0 68 Gm.remove_graph(Go) %
wolffd@0 69 lastClip = intersect(Go.clips,Gm.clips)
wolffd@0 70
wolffd@0 71 % ---
wolffd@0 72 % ok lets chase the last clip
wolffd@0 73 % ---
wolffd@0 74 Gm.node(21950)
wolffd@0 75 Gs = Gm.connected_components(283);
wolffd@0 76 Gs.visualise
wolffd@0 77 DiGraph(Go).visualise
wolffd@0 78
wolffd@0 79
wolffd@0 80 % ---
wolffd@0 81 % validation with comparison data
wolffd@0 82 % ---
wolffd@0 83 Gm = ClipSimGraphMulti(comparison, comparison_ids);
wolffd@0 84 num_compares = sparse(numel(comparison_ids), numel(comparison_ids));
wolffd@0 85 for i = 1:size(comparison,1)
wolffd@0 86 abc = sort(comparison(i,1:3));
wolffd@0 87 a = abc(1);
wolffd@0 88 b = abc(2);
wolffd@0 89 c = abc(3);
wolffd@0 90 num_compares(a,b) = num_compares(a,b) +1;
wolffd@0 91 num_compares(b,c) = num_compares(b,c) +1;
wolffd@0 92 num_compares(a,c) = num_compares(a,c) +1;
wolffd@0 93 end
wolffd@0 94
wolffd@0 95 [i,j] = ind2sub(find(num_compares > 2))
wolffd@0 96 [i,j] = ind2sub(size(num_compares), find(num_compares > 2))
wolffd@0 97 [i,j] = ind2sub(size(num_compares), find(num_compares > 1)),
wolffd@0 98 i(1)
wolffd@0 99 j(1)
wolffd@0 100 find(comparison(:,1) == i(1) || comparison(:,2) == i(1) || comparison(:,3) == i(1)...)
wolffd@0 101 && comparison(:,1) == j(1) || comparison(:,2) == j(1) || comparison(:,3) == j(1))
wolffd@0 102 find((comparison(:,1) == i(1) | comparison(:,2) == i(1) | comparison(:,3) == i(1))...)
wolffd@0 103 & (comparison(:,1) == j(1) | comparison(:,2) == j(1) | comparison(:,3) == j(1)))
wolffd@0 104
wolffd@0 105 num = 2;
wolffd@0 106 a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0 107 & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0 108 comparison(a,:)
wolffd@0 109 [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0 110 num = 3;
wolffd@0 111 a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0 112 & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0 113 comparison(a,:)
wolffd@0 114 [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0 115 num = 18;
wolffd@0 116 a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0 117 & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0 118 comparison(a,:)
wolffd@0 119 [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0 120 num = 300;
wolffd@0 121 a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0 122 & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0 123 comparison(a,:)
wolffd@0 124
wolffd@0 125 % ---
wolffd@0 126 % other simulated data
wolffd@0 127 % ---
wolffd@0 128 ClipSimGraph([1 2 3 5 1 0;], 1:100).visualise
wolffd@0 129 ClipSimGraph([1 2 3 5 1 0; 1 2 4 6 0 0], 1:100).visualise
wolffd@0 130 ClipSimGraph([1 2 3 5 1 0; 1 2 4 6 0 0], 1:100).max_degree
wolffd@0 131 G = ClipSimGraph(comparison, comparison_ids);
wolffd@0 132
wolffd@0 133 % ---
wolffd@0 134 % scc algorithm tests
wolffd@0 135 % ---
wolffd@0 136 V = ones(1,5)
wolffd@0 137 E = zeros(5)
wolffd@0 138 for i=1:4
wolffd@0 139 E(i+1,i) = 1
wolffd@0 140 end
wolffd@0 141 E(1,4) = 1
wolffd@0 142 gtest = DiGRaph(V,E)
wolffd@0 143
wolffd@0 144 gtest.strongly_connected_components(4)
wolffd@0 145 gtest.strongly_connected_components(5)
wolffd@0 146