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.md | 64 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 64 insertions(+) create mode 100644 doc/ba.md (limited to 'doc/ba.md') diff --git a/doc/ba.md b/doc/ba.md new file mode 100644 index 0000000..1c367fa --- /dev/null +++ b/doc/ba.md @@ -0,0 +1,64 @@ +ba(1) -- Grow a Barabasi-Albert scale-free random graph +====== + +## SYNOPSIS + +`ba` + +## DESCRIPTION + +`ba` grows an undirected random scale-free graph with nodes using +the linear preferential attachment model proposed by Barabasi and +Albert. The initial network is a ring of nodes, and each new node +creates new edges. The resulting graph will have a scale-free +degree distribution, whose exponent converges to `gamma=3.0` for large +. + +## PARAMETERS + +* : + Number of nodes of the final graph. + +* : + Number of edges created by each new node. + +* : + 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 nodes, where +each new node creates new edges and the initial seed network is +a ring of 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 + +* A\.-L. Barabasi, R. Albert, "Emergence of scaling in random + networks", Science 286, 509-512 (1999). + +* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles, + Methods and Applications", Chapter 6, Cambridge University Press + (2017) + +* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles, + Methods and Applications", Appendix 13, Cambridge University Press + (2017) + + +## AUTHORS + +(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 ``. + -- cgit v1.2.3