On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
| Hi-index | 0.00 |
A great amount of natural and artificial systems can be represented as a complex network, where the entities of the system are related of non-trivial form. Thus, the network topology is the pattern of the interactions between entities. The characterization of complex networks allows analyzing, classifying and modeling the topology of complex networks. The degree distribution is a characterization function used in the analysis of complex networks. In this work a comparative study of the degree distribution for three different instances of the Internet was carried out, with information about the interconnection of domains. The Internet has a degree distribution power-law, that is, it has a great amount of weakly connected domains while a few domains have a great number of connections. Our results show that Internet has a dynamic growing maintaining the degree distribution power-law through the time, independently of the growth in the number of domains and its connections.