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/ba.1.html | 153 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 153 insertions(+) create mode 100644 doc/ba.1.html (limited to 'doc/ba.1.html') diff --git a/doc/ba.1.html b/doc/ba.1.html new file mode 100644 index 0000000..37f6e97 --- /dev/null +++ b/doc/ba.1.html @@ -0,0 +1,153 @@ + + + + + + ba(1) - Grow a Barabasi-Albert scale-free random graph + + + + + +
+ + + +
    +
  1. ba(1)
    2. +
  2. www.complex-networks.net
    3. +
  3. ba(1)
    4. +
+ +

NAME

+

+ ba - Grow a Barabasi-Albert scale-free random graph +

+ +

SYNOPSIS

+ +

ba N m n0

+ +

DESCRIPTION

+ +

ba grows an undirected random scale-free graph with N nodes using +the linear preferential attachment model proposed by Barabasi and +Albert. The initial network is a ring of n0 nodes, and each new node +creates m new edges. The resulting graph will have a scale-free +degree distribution, whose exponent converges to gamma=3.0 for large +N.

+ +

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.

+
+ + +

OUTPUT

+ +

ba prints on STDOUT the edge list of the final graph.

+ +

EXAMPLES

+ +

The following command:

+ +
    $ ba 10000 3 5 > ba_10000_3_5.txt
+
+ +

creates a Barabasi-Albert 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. The edge list of the graph is saved in the +file ba_10000_3_5.txt (thanks to the redirection operator >).

+ +

SEE ALSO

+ +

bb_fitness(1), dms(1), bbv(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. ba(1)
    4. +
+ +
+ + -- cgit v1.2.3