We develop three different algorithms for implementing the Preferential Attachment mechanism, with regards to the Yule process, able to describe how statistical power-law distributions, for various properties of OO software systems and of the internet, are generated. Since modern software systems have reached a huge dimension, counting tens, or hundreds of thousand, of units or modules, the efficiency of algorithms for their simulation is a critical issue. We discuss their efficiency for different parameters value, their scaling with system size, and analyze in which cases one is preferable with respect to the others.
Efficient implementation of the Yule-Simon stochastic process for modeling internet and software development activities
TONELLI, ROBERTO;
2009-01-01
Abstract
We develop three different algorithms for implementing the Preferential Attachment mechanism, with regards to the Yule process, able to describe how statistical power-law distributions, for various properties of OO software systems and of the internet, are generated. Since modern software systems have reached a huge dimension, counting tens, or hundreds of thousand, of units or modules, the efficiency of algorithms for their simulation is a critical issue. We discuss their efficiency for different parameters value, their scaling with system size, and analyze in which cases one is preferable with respect to the others.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
