2.2.1.0 nibilab_linear

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_docsu43.html | 158 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 158 insertions(+) create mode 100644 doc/html/mammult_docsu43.html (limited to 'doc/html/mammult_docsu43.html') diff --git a/doc/html/mammult_docsu43.html b/doc/html/mammult_docsu43.html new file mode 100644 index 0000000..d88d970 --- /dev/null +++ b/doc/html/mammult_docsu43.html @@ -0,0 +1,158 @@ + + +2.2.1.0 nibilab_linear_delay + + + + + + + + +

[next] [prev] [prev-tail] [tail] [up]

nibilab_linear_delay

NAME +

nibilab_linear_delay - Multiplex linear preferential attachment model – +Asynchronous arrival. +

SYNOPSYS +

nibilab_linear_delay <N> <m> <m0> <outfile> <a> <b> <c> +<d> <beta> +

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: +
+ $1 [1] [2] +Π i→j ∝ akj + bkj +$
+

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

Each new node arrives first on layer 1, and its replica on the layer 2 appears +after a time delay τ sampled from the power-law function: +
+ $P(τ) ∼ τ−β +$
+

The (mandatory) parameters are as follows: +

N number of nodes in the final graph +
m number of new edges brought by each new node +
m0 number of nodes in the initial seed graph. m0 must be larger than + of equal to m. +
outfile the name of the file which will contain the +
a,b,c,d the coefficients of the attaching probability function +
beta the exponent of the power-law delay function which determines + the arrival of replicas on layer 2 +

+ + + +

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 + + + +

[next] [prev] [prev-tail] [front] [up]

+ -- cgit v1.2.3