|
From: | Daniele Capocefalo |
Subject: | [igraph] Understanding Barabasi Function and how to simulate a scale free() |
Date: | Thu, 20 Apr 2017 19:39:24 +0200 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.8.0 |
Hello Everone,I have one question regarding the Barabasi Function in GraphBase (python). The "m" parameter states
"either the number of outgoing edges generated for each vertex or a list containing the number of outgoing edges for each vertex explicitly"
It isn't clear whether this m implies the average degree of the scale free network or something else. Additionally, since it clearly states "outgoing edges", do I need to convert the network to undirect after calling the Barabasi() method?
Moreover, I need to simulate several scale free networks that "mirrors" real networks I'm studying. To this extent, I was searching for a function or an algorithm to infer the exponential parameter for the power law. does igraph for python offer something like this? Alternatively, could I use the average degree of the real networks and give it to the Barabasi() function when defining "m"?
Thanks a lot for your time! Cheers, Daniele -- ——— Daniele Capocefalo Bioinformatics unit Casa Sollievo della Sofferenza - Mendel Viale Regina Margherita 261 - 00198 Roma IT Tel: +39 06 44160526 - Fax: +39 06 44160548 E-mail: address@hidden Web page: http://www.css-mendel.it/ Web page: http://bioinformatics.css-mendel.it
[Prev in Thread] | Current Thread | [Next in Thread] |