diff options
Diffstat (limited to 'doc/latex/latex/structure/activity')
9 files changed, 257 insertions, 0 deletions
diff --git a/doc/latex/latex/structure/activity/degs_to_activity_overlap.tex b/doc/latex/latex/structure/activity/degs_to_activity_overlap.tex new file mode 100644 index 0000000..6e1908f --- /dev/null +++ b/doc/latex/latex/structure/activity/degs_to_activity_overlap.tex @@ -0,0 +1,29 @@ +\myprogram{{degs\_to\_activity\_overlap.py}} + {compute the activity and the total (overlapping) degree of + all the nodes of a multiplex.} + {$<$degree\_vectors$>$} + +\mydescription{Take a file which contains, on the n-th line, the degrees at each + layer of the n-th node, (e.g., the result of the + script \texttt{node\_degree\_vectors.py}), in the format: + + \hspace{0.5cm}\textit{noden\_deg\_lay1 noden\_deg\_lay2 ... noden\_deg\_layM} + + \noindent and compute the activity (i.e., the number of layers in + which a node is not isolated) and the total (overlapping) degree of + each node.} + +\myreturn{The program prints on \texttt{stdout} a list of lines, where + the n-th line contains the activity and the total degree of the n-th + nodem in the format: + + \hspace{0.5cm}\textit{noden\_activity noden\_tot\_deg} + + \noindent As usual, the program assumes that node IDs start from zero + and proceed sequentially, without gaps, i.e., if a node ID is not + present in any of the layer files given as input, the program + considers it as being isolated on all the layers. + } + +\myreference{\refcorrelations} + diff --git a/doc/latex/latex/structure/activity/degs_to_binary.tex b/doc/latex/latex/structure/activity/degs_to_binary.tex new file mode 100644 index 0000000..7441b2d --- /dev/null +++ b/doc/latex/latex/structure/activity/degs_to_binary.tex @@ -0,0 +1,32 @@ +\myprogram{{degs\_to\_binary.py}} + {compute the activity vectors of all the nodes of a multiplex.} + {$<$degree\_vectors$>$} + +\mydescription{Take a file which contains, on the n-th line, the degrees at each + layer of the n-th node, (e.g., the result of the + script \texttt{node\_degree\_vectors.py}), in the format: + + \hspace{0.5cm}\textit{noden\_deg\_lay1 noden\_deg\_lay2 ... noden\_deg\_layM} + + \noindent and compute the corresponding node activity bit-strings, + where a "1" signals the presence of the node on that layer, while a + zero indicates its absence. +} + +\myreturn{The program returns on \texttt{stdout} a list of lines, + where the n-th line is the activity bit-string of the n-th + node. Additionally, the program prints on \texttt{stderr} the + distribution of all activity bit-strings, in the format: + + \hspace{0.5cm}\textit{Bn Bit-string count} + + \noindent Where \textit{B} is the number of ones in the activity + bit-string (i.e., the node-activity associated to that activity + bit-string), \textit{Bit-string} is the activity bit-string + and \textit{count} is the number of times that particular activity + bit-string appears in the multiplex.} + + + +\myreference{\refcorrelations} + diff --git a/doc/latex/latex/structure/activity/hamming_dist.tex b/doc/latex/latex/structure/activity/hamming_dist.tex new file mode 100644 index 0000000..3af188f --- /dev/null +++ b/doc/latex/latex/structure/activity/hamming_dist.tex @@ -0,0 +1,31 @@ +\myprogram{{hamming\_dist.py}} + {compute the normalised Hamming distance between all the pairs of + layers of a multiplex.} + {$<$layer1$>$ $<$layer2$>$ [$<$layer3$>$...]} + +\mydescription{Compute and print on output the normalised Hamming distance + $H_{\alpha, \beta}$ (i.e., the fraction of nodes which are active on + either of the layers, but not on both) between all pairs of + layers. The layers are given as input in the + files \textit{layer1}, \textit{layer2}, etc. + + Each input file contains the (undirected) edge list of a layer, and + each line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{The program prints on \texttt{stdout} a list of lines, in + the format: + + \hspace{0.5cm} \textit{layer1 layer2 hamm} + + \noindent where \textit{layer1} and \textit{layer2} are the IDs of + the layers, and \textit{hamm} is the value of the normalised Haming + distance $H_{layer1, layer2}$. Layers IDs start from zero, are are + associated to the layers in the same order in which the layer files + are provided on the command line.} + +\myreference{\refcorrelations} diff --git a/doc/latex/latex/structure/activity/layer_activity.tex b/doc/latex/latex/structure/activity/layer_activity.tex new file mode 100644 index 0000000..34fcdd2 --- /dev/null +++ b/doc/latex/latex/structure/activity/layer_activity.tex @@ -0,0 +1,25 @@ +%%% +%%% Layer activity +%%% + +\myprogram{{layer\_activity.py}} + {compute the activity of the layers of a multiplex, i.e. the + number of active nodes on each layer.} + {$<$layer1$>$ [$<$layer2$>$ ...]} + +\mydescription{Compute and print on output the activity of the layers + of a multiplex network, where the layers are given as input in the + files \textit{layer1}, \textit{layer2}, etc. + + Each file contains the (undirected) edge list of a layer, and each + line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{A listof lines, where the n-th line is the value of activity + of the n-th layer, starting from \textbf{0}.} + +\myreference{\refcorrelations} diff --git a/doc/latex/latex/structure/activity/layer_activity_vectors.tex b/doc/latex/latex/structure/activity/layer_activity_vectors.tex new file mode 100644 index 0000000..f0c2cd6 --- /dev/null +++ b/doc/latex/latex/structure/activity/layer_activity_vectors.tex @@ -0,0 +1,27 @@ +\myprogram{{layer\_activity\_vectors.py}} + {compute the activity vectors of all the layers of a multiplex.} + {$<$layer1$>$ [$<$layer2$>$ ...]} + +\mydescription{Compute and print on output the activity vectors of the + layers of a multiplex network, where the layers are given as input + in the files \textit{layer1}, \textit{layer2}, etc. + + Each input file contains the (undirected) edge list of a layer, and + each line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{The program prints on \texttt{stdout} a list of lines, where + the n-th line contains the activity vector of the n-th layer, i.e. a + bit-string where each bit is set to ``1'' if the corresponding node + is active on the n-th layer, and to ``0'' otherwise. + + \noindent As usual, node IDs start from zero and proceed + sequentially, without gaps, i.e., if a node ID is not present in any + of the layer files given as input, the program considers it as being + isolated on all the layers.} + +\myreference{\refcorrelations} diff --git a/doc/latex/latex/structure/activity/multiplexity.tex b/doc/latex/latex/structure/activity/multiplexity.tex new file mode 100644 index 0000000..b5c5506 --- /dev/null +++ b/doc/latex/latex/structure/activity/multiplexity.tex @@ -0,0 +1,30 @@ +\myprogram{{multiplexity.py}} + {compute the pairwise multiplexity between all the pairs of + layers of a multiplex.} + {$<$layer1$>$ $<$layer2$>$ [$<$layer3$>$...]} + +\mydescription{Compute and print on output the pairwise multiplexity + $Q_{\alpha, \beta}$ (i.e., the fraction of nodes active on both + layers) between all pairs of layers. The layers are given as + input in the files \textit{layer1}, \textit{layer2}, etc. + + Each input file contains the (undirected) edge list of a layer, and + each line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{The program prints on \texttt{stdout} a list of lines, in + the format: + + \hspace{0.5cm} \textit{layer1 layer2 mult} + + \noindent where \textit{layer1} and \textit{layer2} are the IDs of + the layers, and \textit{mult} is the value of the multiplexity + $Q_{layer1, layer2}$. Layers IDs start from zero, are are associated + to the layers in the same order in which the layer files are + provided on the command line.} + +\myreference{\refcorrelations} diff --git a/doc/latex/latex/structure/activity/node_activity.tex b/doc/latex/latex/structure/activity/node_activity.tex new file mode 100644 index 0000000..882233d --- /dev/null +++ b/doc/latex/latex/structure/activity/node_activity.tex @@ -0,0 +1,25 @@ +%%% +%%% node_activity +%%% +\myprogram{{node\_activity.py}} + {compute the activity of the nodes of a multiplex, i.e. the + number of layers where each node is not isolated.} + {$<$layer1$>$ [$<$layer2$>$ ...]} + +\mydescription{Compute and print on output the activity of the nodes + of a multiplex network, whose layers are given as input in the files + \textit{layer1}, \textit{layer2}, etc. + + Each file contains the (undirected) edge list of a layer, and each + line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{A list of lines, where the n-th line is the value of activity + of the n-th node, starting from \textbf{0}.} + +\myreference{\refcorrelations} + diff --git a/doc/latex/latex/structure/activity/node_activity_vectors.tex b/doc/latex/latex/structure/activity/node_activity_vectors.tex new file mode 100644 index 0000000..ca9301d --- /dev/null +++ b/doc/latex/latex/structure/activity/node_activity_vectors.tex @@ -0,0 +1,28 @@ +\myprogram{{node\_activity\_vectors.py}} + {compute the activity vectors of all the nodes of a multiplex.} + {$<$layer1$>$ [$<$layer2$>$ ...]} + +\mydescription{Compute and print on output the activity vectors of the + nodes of a multiplex network, whose layers are given as input in the + files \textit{layer1}, \textit{layer2}, etc. + + Each input file contains the (undirected) edge list of a layer, and + each line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{The program prints on \texttt{stdout} a list of lines, where + the n-th line contains the activity vector of the n-th node, i.e. a + bit-string where each bit is set to ``1'' if the node is active on + the corresponding layer, and to ``0'' otherwise. + + \noindent As usual, node IDs start from zero and proceed + sequentially, without gaps, i.e., if a node ID is not present in any + of the layer files given as input, the program considers it as being + isolated on all the layers, and will print on output a bit-string of + zeros.} + +\myreference{\refcorrelations} diff --git a/doc/latex/latex/structure/activity/node_degree_vectors.tex b/doc/latex/latex/structure/activity/node_degree_vectors.tex new file mode 100644 index 0000000..c86f083 --- /dev/null +++ b/doc/latex/latex/structure/activity/node_degree_vectors.tex @@ -0,0 +1,30 @@ +\myprogram{{node\_degree\_vectors.py}} + {compute the degree vectors of all the nodes of a multiplex network} + {$<$layer1$>$ [$<$layer2$>$ ...]} + +\mydescription{Compute and print on output the degree vectors of all + the nodes of a multiplex network, whose layers are given as + input in the files \textit{layer1}, \textit{layer2}, etc. + + Each file contains the (undirected) edge list of a layer, and each + line is in the format: + + \hspace{0.5cm}\textit{src\_ID} \textit{dest\_ID} + + where \textit{src\_ID} and \textit{dest\_ID} are the IDs of the two + endpoints of an edge.} + +\myreturn{A list of lines, where the n-th line is the + vector of degrees of the n-th node, in the format: + + \hspace{0.5cm}\textit{noden\_deg\_lay1 noden\_deg\_lay2 ... noden\_deg\_layM} + + \noindent As usual, node IDs start from zero and proceed + sequentially, without gaps, i.e., if a node ID is not present in any + of the layer files given as input, the program considers it as being + isolated on all the layers. + +} + +\myreference{\refgrowth\\ \\ \indent \refmetrics} + |