Construct · 2 fields · 2 citations

Where does hub collide?

One name. Different field. Different construct. One map.

● jingle · one word, two constructs Nearest construct by meaningswitchcompare the meanings
How to read this

Every construct on the map is compared with every other by the meaning of its definitions, and the closest one is surfaced here. The nearest construct to hub is switch.

Hold this as a prompt, not a verdict. Two constructs sitting close in meaning is a reason to read them side by side and decide for yourself whether they are one idea under two names. It is not proof that they are. Compare the meanings in the Collider.

hub2 CONSTRUCTSAirport hubO'KELLY · TRANSFER POINTHub (graph)BARABÁSI · SCALE-FREE HUB

Spokes are fields; dashed arcs are shared lineage. Tap a field for its definition, unit, and measures.

2026

Drag to watch the word get claimed. Each field appears at the publication date of the earliest source cited for it. Tap a year to see which.

Transportation and operations research

A central transfer point

The central facility in a hub-and-spoke transport or distribution network, through which flows between many origins and destinations are consolidated and re-routed rather than sent directly: concentrating traffic at a few hubs lets an airline or carrier serve many city pairs with fewer links and fuller, cheaper vehicle loads. O'Kelly's 1987 A quadratic integer program for the location of interacting hub facilities set out the problem of where to place such hubs so that the total interacting flow cost is minimised. The referent is a chosen node in a logistics network, valued for the routing it enables, not a device on a wire, a well-connected point in an abstract graph, or the centre of a wheel.[1]

Unit
A consolidation node in a transport network, by routed flow and cost
Recovery means
Not applicable
Measured by
Assessed by throughput, connecting traffic, and the flow-weighted routing cost of the network it anchors

Network science and graph theory

A high-degree network node

A node whose degree is far higher than that of a typical node, so that it connects to a disproportionate share of the network: in a scale-free network the degree distribution follows a power law, which makes such hubs both expected and structurally important for connectivity and for how failures or contagions spread. Barabási and Albert's 1999 Emergence of scaling in random networks showed how growth with preferential attachment produces this heavy-tailed distribution and the hubs in its tail. The referent is a property of a vertex in an abstract graph, fixed by its degree, not a transport facility, a repeater device, or a mechanical centre.[2]

Unit
A vertex of unusually high degree in a graph
Recovery means
Not applicable
Measured by
Identified by node degree or a centrality measure, and by the heavy tail of the degree distribution

Next

Run it through the Collider, or take the citations with you.

See how hub sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this collision

Nearby collisions

network4 fields · 6 citationsjingle · one word, four constructsnode2 fields · 4 citationsjingle · one word, two constructscluster4 fields · 4 citationsjingle · one word, four constructs

References

  1. O'Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32(3), 393–404. https://doi.org/10.1016/S0377-2217(87)80007-3
  2. Barabási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509–512. https://doi.org/10.1126/science.286.5439.509

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct