2.2.1.0 nibilab_linear_random

NAME

nibilab_linear_random_times - Multiplex linear preferential attachment model – Asynchronous arrival with randomly sampled arrival times on layer 2.

SYNOPSYS

nibilab_linear_random_times <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 [1] [2] Π i→j ∝ ck j + dkj

Each new node arrives on layer 1, but its replica on the other layer appears at a uniformly chosen random time in [m0 + 1;N].

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

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).