From a86962cbfd0321387c920a04188512d0de2f3036 Mon Sep 17 00:00:00 2001 From: KatolaZ Date: Mon, 19 Oct 2015 16:30:12 +0100 Subject: First commit of MAMMULT documentation --- doc/html/mammult_docsu42.html | 145 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 145 insertions(+) create mode 100644 doc/html/mammult_docsu42.html (limited to 'doc/html/mammult_docsu42.html') diff --git a/doc/html/mammult_docsu42.html b/doc/html/mammult_docsu42.html new file mode 100644 index 0000000..5727bf0 --- /dev/null +++ b/doc/html/mammult_docsu42.html @@ -0,0 +1,145 @@ + + +2.2.1.0 nibilab_linear_delta + + + + + + + + + +
nibilab_linear_delta
+

NAME +

nibilab_linear_delta - Multiplex linear preferential attachment model – +Synchronous arrival. +

SYNOPSYS + + + +

nibilab_linear_delta <N> <m> <m0> <outfile> <a> <b> <c> +<d> +

DESCRIPTION +

Grow a two-layer multiplex network using the multiplex linear preferential +attachment model by Nicosia, Bianconi, Latora, Barthelemy (NiBiLaB). +

The probability for a newly arrived node i to create a link to node j on layer +1 is: +
+
+Π1i→j ∝  ak[1j]+ bk[j2]
+
+

+

and the dual probability for i to create a link to j on layer 2 is: +
+
+Π2   ∝  ck [1]+ dk[2]
+  i→j      j     j
+
+

+

Each new node arrives at the same time on both layers. +

The (mandatory) parameters are as follows: +

+

OUTPUT +

The program dumps on the file outfile the (undirected) edge list of the +resulting network. Each line of the file is in the format: +

  src_ID dest_ID +

where src_ID and dest_ID are the IDs of the two endpoints of an +edge. +

REFERENCE +

V. Nicosia, G. Bianconi, V. Latora, M. Barthelemy, “Growing multiplex +networks”, Phys. Rev. Lett. 111, 058701 (2013). +

Link to paper: http://prl.aps.org/abstract/PRL/v111/i5/e058701 + + + +

+

+ -- cgit v1.2.3