CIShell Manual : Degree Distribution
This page last changed on Jan 12, 2011 by dapolley.
DescriptionThe algorithm builds the histogram of the values of the degree of all nodes, which will be delivered in the two output files. Pros & ConsThe network to analyze must be undirected, otherwise there are no special constraints. ApplicationsBasic analysis tool, not particular for special disciplines or problems. Implementation DetailsThe algorithm requires two inputs, the file where the edges of the network are listed and the number of points one wishes to have in the binned distribution described below. A first read-in of the inputfile will set the values of the number of nodes and edges of the network. In the second read-in the degrees of all nodes will be calculated. Then the distribution is calculated. Usage HintsA simple application of this algorithm could be to calculate the degree distribution of networks created by the modeling algorithms of the NWB. For instance, the network file can be created through the Barabasi-Albert model. LinksAcknowledgementsThe algorithm was implemented and documented by S. Fortunato, integrated by S. Fortunato and W. Huang. ReferencesAlbert, R., and Barabasi, A.-L. (2002) Statistical mechanics of complex networks. Review of Modern Physics 74:47-97. Newman, M.E.J. (2003) The structure and function of complex networks. SIAM Review 45:167-256. Pastor-Satorras, R., Vespignani, A. (2004) Evolution and Structure of the Internet. Cambridge University Press. Boccaletti, S., Latora, V., Moreno, Y.,Chavez, M., Hwang, D.-U. (2006) Complex networks: Structure and dynamics. Physics Reports 424: 175-308. See Also |
![]() |
Document generated by Confluence on May 31, 2011 16:37 |