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
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd">
<html >
<head><title>1.1.1.0 node_degree_vectors.py</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">
<!-- html,index=2,3,4,5,next -->
<meta name="src" content="mammult_doc.tex">
<meta name="date" content="2015-10-19 16:26:00">
<link rel="stylesheet" type="text/css" href="mammult_doc.css">
</head><body
>
<!--l. 3--><div class="crosslinks"><p class="noindent">[<a
href="mammult_docsu9.html" >next</a>] [<a
href="mammult_docsu7.html" >prev</a>] [<a
href="mammult_docsu7.html#tailmammult_docsu7.html" >prev-tail</a>] [<a
href="#tailmammult_docsu8.html">tail</a>] [<a
href="mammult_docsu1.html#mammult_docsu8.html" >up</a>] </p></div>
<h5 class="subsubsectionHead"><a
id="x11-100001.1.1"></a><span
class="cmtt-10x-x-109">node</span><span
class="cmtt-10x-x-109">_degree</span><span
class="cmtt-10x-x-109">_vectors.py</span></h5>
<!--l. 3--><p class="noindent" ><span
class="cmbx-10x-x-109">NAME</span>
<!--l. 3--><p class="indent" > <span
class="cmbx-10x-x-109">node</span><span
class="cmbx-10x-x-109">_degree</span><span
class="cmbx-10x-x-109">_vectors.py </span>- compute the degree vectors of all the nodes of a
multiplex network
<!--l. 3--><p class="noindent" ><span
class="cmbx-10x-x-109">SYNOPSYS</span>
<!--l. 3--><p class="indent" > <span
class="cmbx-10x-x-109">node</span><span
class="cmbx-10x-x-109">_degree</span><span
class="cmbx-10x-x-109">_vectors.py </span><span
class="cmmi-10x-x-109"><</span><span
class="cmitt-10x-x-109">layer1</span><span
class="cmmi-10x-x-109">> </span><span
class="cmitt-10x-x-109">[</span><span
class="cmmi-10x-x-109"><</span><span
class="cmitt-10x-x-109">layer2</span><span
class="cmmi-10x-x-109">> </span><span
class="cmitt-10x-x-109">...]</span>
<!--l. 15--><p class="noindent" ><span
class="cmbx-10x-x-109">DESCRIPTION</span>
<!--l. 15--><p class="indent" > 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 <span
class="cmti-10x-x-109">layer1</span>, <span
class="cmti-10x-x-109">layer2</span>,
etc.
<!--l. 15--><p class="indent" > Each file contains the (undirected) edge list of a layer, and each line is in the
format:
<!--l. 15--><p class="indent" >   <span
class="cmti-10x-x-109">src</span><span
class="cmti-10x-x-109">_ID dest</span><span
class="cmti-10x-x-109">_ID</span>
<!--l. 15--><p class="indent" > where <span
class="cmti-10x-x-109">src</span><span
class="cmti-10x-x-109">_ID </span>and <span
class="cmti-10x-x-109">dest</span><span
class="cmti-10x-x-109">_ID </span>are the IDs of the two endpoints of an
edge.
<!--l. 27--><p class="noindent" ><span
class="cmbx-10x-x-109">OUTPUT</span>
<!--l. 27--><p class="indent" > A list of lines, where the n-th line is the vector of degrees of the n-th node, in
the format:
<!--l. 27--><p class="indent" >   <span
class="cmti-10x-x-109">noden</span><span
class="cmti-10x-x-109">_deg</span><span
class="cmti-10x-x-109">_lay1 noden</span><span
class="cmti-10x-x-109">_deg</span><span
class="cmti-10x-x-109">_lay2 ... noden</span><span
class="cmti-10x-x-109">_deg</span><span
class="cmti-10x-x-109">_layM</span>
<!--l. 27--><p class="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.
<!--l. 29--><p class="noindent" ><span
class="cmbx-10x-x-109">REFERENCE</span>
<!--l. 29--><p class="indent" > V. Nicosia, G. Bianconi, V. Latora, M. Barthelemy, “Growing multiplex
networks”, <span
class="cmti-10x-x-109">Phys. Rev. Lett. </span><span
class="cmbx-10x-x-109">111</span>, 058701 (2013).
<!--l. 29--><p class="indent" > Link to paper: <a
href="http://prl.aps.org/abstract/PRL/v111/i5/e058701" class="url" ><span
class="cmtt-10x-x-109">http://prl.aps.org/abstract/PRL/v111/i5/e058701</span></a>
<br
class="newline" /><br
class="newline" /> F. Battiston, V. Nicosia, V. Latora, “Structural measures for multiplex
networks”, <span
class="cmti-10x-x-109">Phys. Rev. E </span><span
class="cmbx-10x-x-109">89</span>, 032804 (2014).
<!--l. 29--><p class="indent" > Link to paper: <a
href="http://journals.aps.org/pre/abstract/10.1103/PhysRevE.89.032804" class="url" ><span
class="cmtt-10x-x-109">http://journals.aps.org/pre/abstract/10.1103/PhysRevE.89.032804</span></a>
<!--l. 3--><div class="crosslinks"><p class="noindent">[<a
href="mammult_docsu9.html" >next</a>] [<a
href="mammult_docsu7.html" >prev</a>] [<a
href="mammult_docsu7.html#tailmammult_docsu7.html" >prev-tail</a>] [<a
href="mammult_docsu8.html" >front</a>] [<a
href="mammult_docsu1.html#mammult_docsu8.html" >up</a>] </p></div>
<!--l. 3--><p class="indent" > <a
id="tailmammult_docsu8.html"></a>
</body></html>
|
