page_title: Hub (network science)
hierarchical_section_title: Hub (network science)
caption_attribution_description: Беларуская (тарашкевіца)‎: Частковая мапа інтэрнэта, заснаваная на дадзеных ад 15 студзеня 2005 г. на opte.org. Кожная лінія намалявана паміж двума вузламі, злучая два IP-адрасы. Даўжыня лініі паказвае часавую затрымку (пінг) паміж двума вузламі. Мапа ўяўляе меньш за 30% сетак клясы C даступных для збора дадзеных у 2005 годзе. Колер лініі адпавядае яе месцазнаходжаньню адпаведна RFC 1918. Выкарыстоўваюцца наступныя колеры: Цёмна-сіні: net, ca, us Зялёны: com, org Чырвоны: mil, gov, edu Жоўты: jp, cn, tw, au, de Фіялетавы: uk, it, pl, fr Залаты: br, kr, nl Белы: невядома English: Partial map of the Internet based on the January 15, 2005 data found on opte.org. Each line is drawn between two nodes, representing two IP addresses. The length of the lines are indicative of the delay between those two nodes. This graph represents less than 30% of the Class C networks reachable by the data collection program in early 2005. Lines are color-coded according to their corresponding RFC 1918 allocation as follows: Dark blue: net, ca, us Green: com, org Red: mil, gov, edu Yellow: jp, cn, tw, au, de Magenta: uk, it, pl, fr Gold: br, kr, nl White: unknown Nederlands: Deelkaart van het internet, gebaseerd op de gegevens die op 15 januari 2005 op opte.org beschikbaar waren. Elk van de lijnen verbindt twee knooppunten, en representeert dus twee IP adressen. De lengtes van de lijnen zijn maatgevend voor de looptijd tussen de twee knooppunten. Deze grafiek vertegenwoordigt nog geen 30% van de klasse C netwerken die vroeg in 2005 voor het data collectie programma bereikbaar waren. De kleurcodering van de lijnen correspondeert op de volgende wijze met hun RFC 1918 toewijzing: Blauw: net, ca, us Groen: com, org Rood: mil, gov, edu Geel: jp, cn, tw, au, de Paars: uk, it, pl, fr Goud: br, kr, nl Wit: unknown
context_page_description: In network science, a hub is a node with a number of links that greatly exceeds the average. Emergence of hubs is a consequence of a scale-free property of networks. While hubs cannot be observed in a random network, they are expected to emerge in scale-free networks. The uprise of hubs in scale-free networks is associated with power-law distribution. Hubs have a significant impact on the network topology. Hubs can be found in many real networks, such as the brain or the Internet.
  A hub is a component of a network with a high-degree node. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links for a hub in a scale-free network is much higher than for the biggest node in a random network, keeping the size N of the network and average degree <k> constant. The existence of hubs is the biggest difference between random networks and scale-free networks. In random networks, the degree k is comparable for every node; it is therefore not possible for hubs to emerge. In scale-free networks, a few nodes have a high degree k while the other nodes have a small number of links.
context_section_description: In network science, a hub is a node with a number of links that greatly exceeds the average. Emergence of hubs is a consequence of a scale-free property of networks. While hubs cannot be observed in a random network, they are expected to emerge in scale-free networks. The uprise of hubs in scale-free networks is associated with power-law distribution. Hubs have a significant impact on the network topology. Hubs can be found in many real networks, such as the brain or the Internet.
  A hub is a component of a network with a high-degree node. Hubs have a significantly larger number of links in comparison with other nodes in the network. The number of links (degrees) for a hub in a scale-free network is much higher than for the biggest node in a random network, keeping the size N of the network and average degree <k> constant. The existence of hubs is the biggest difference between random networks and scale-free networks. In random networks, the degree k is comparable for every node; it is therefore not possible for hubs to emerge. In scale-free networks, a few nodes (hubs) have a high degree k while the other nodes have a small number of links.
caption: Partial map of the Internet based on the January 15, 2005. Hubs are highlighted
exif: {}