From 3aee2fd43e3059a699af2b63c6f2395e5a55e515 Mon Sep 17 00:00:00 2001 From: KatolaZ Date: Wed, 27 Sep 2017 15:06:31 +0100 Subject: First commit on github -- NetBunch 1.0 --- doc/bbv.1.html | 169 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 169 insertions(+) create mode 100644 doc/bbv.1.html (limited to 'doc/bbv.1.html') diff --git a/doc/bbv.1.html b/doc/bbv.1.html new file mode 100644 index 0000000..9fe7016 --- /dev/null +++ b/doc/bbv.1.html @@ -0,0 +1,169 @@ + + + + + + bbv(1) - Grow a weighted scale-free random graph + + + + + +
+ + + +
    +
  1. bbv(1)
    2. +
  2. www.complex-networks.net
    3. +
  3. bbv(1)
    4. +
+ +

NAME

+

+ bbv - Grow a weighted scale-free random graph +

+ +

SYNOPSIS

+ +

bbv N m n0 w0 delta

+ +

DESCRIPTION

+ +

bbv grows an undirected weighted random scale-free graph with N +nodes using the model proposed by Barrat, Barthelemy, and +Vespignani. The initial network is a clique of n0 nodes, and each +new node creates m new edges, each with weight w0. The parameter +delta sets the amount of weight to be redistributed in the +neighbourhood of newly-connected nodes.

+ +

PARAMETERS

+ +
+
N

Number of nodes of the final graph.

+
m

Number of edges created by each new node.

+
n0

Number of nodes in the initial (seed) graph.

+
w0

Weight of each new edge (must be >=0)

+
delta

The amount of weight to be redistributed among the neighbours of + newly-connected nodes.

+
+ + +

OUTPUT

+ +

bbv prints on STDOUT the edge list of the final graph, which +consists of three columns:

+ +
    node1 node2 weight
+
+ +

where weight is the weight of the corresponding edge. Please note +that each edge is printed only once.

+ +

EXAMPLES

+ +

The following command:

+ +
    $ bbv 10000 3 5 1.0 0.5 > bbv_10000_3_5_1.0_0.5.txt
+
+ +

creates a weighted scale-free graph with N=10000 nodes, where each +new node creates m=3 new edges and the initial seed network is a +ring of n0=5 nodes. Each new edge has an initial weight equal to +w0. The weights of existing edges are rearranged after the addition +of a new edge, by rearranging an amount of weight equal to delta. +The final graph is saved in the file bbv_10000_3_5_1.0_0.5.txt +(notice the STDOUT redirection operator >).

+ +

SEE ALSO

+ +

ba(1), bb_fitness(1), dms(1)

+ +

REFERENCES

+ + + + +

AUTHORS

+ +

(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 <v.nicosia@qmul.ac.uk>.

+ + +
    +
  1. www.complex-networks.net
    2. +
  2. September 2017
    3. +
  3. bbv(1)
    4. +
+ +
+ + -- cgit v1.2.3