Network¶

Version: v3 · 2026-10-17 · History
Prime #: 18
Domain group: Formal Sciences
Origin domain: Mathematics
Also from: Systems Thinking & Cybernetics, Sociology & Anthropology, Computer Science & Software Engineering
Aliases: Graph, Graph Network
Related primes: Relation, Hierarchy, Feedback

Core Idea¶

Nodes connected by edges, representing relationships.

How would you explain it like I'm…

Dots and Lines

A network is a bunch of things and the connections between them, like dots with lines drawn between them. You can think about friends and who knows who, or roads and which towns they link. What matters most isn't the dots themselves but who is connected to who.

Connected Things

A network is a set of things with connections between them, drawn as dots (called nodes) and lines (called edges). The things can be people, websites, brain cells, or airports. What makes networks useful is that you can study the pattern of connections by itself, without caring much what the dots are. The same patterns show up in friendships, the internet, food chains, and power grids, so one set of ideas helps you understand all of them.

Connection Pattern

A network is a set of entities together with the pairwise connections among them, studied at the level of connection pattern rather than what the entities are. Connections can be directed or undirected, weighted, typed, or change over time. The point is that structure (who connects to whom) often carries enough explanatory power on its own to predict flows, reachability, influence, failure modes, and dynamics, even when the substance of the entities is set aside. That is why ideas about hubs, paths, communities, and centrality travel from neurons to airports to web pages with little loss.

A network is a set of entities together with a set of pairwise (or higher-order) connections among them, studied at the level of the connection pattern rather than the substantive identity of the entities. The essential commitment is that structure (who is connected to whom, with what weights and directions) can carry enough explanatory power on its own to predict flows, reachability, influence, failure modes, and dynamics. Every network specifies a *node set* (the entities), an *edge set* (the connections, possibly directed, weighted, typed, or time-varying), any annotations on nodes or edges, and the claims the network is being used to support. The field traces from Euler's 1736 Königsberg bridges resolution (which founded graph theory by abstracting geography to nodes and edges), through Erdős and Rényi's random graphs and Watts and Strogatz's small-world model, to Barabási and Albert's scale-free networks. A small structural vocabulary (degree distribution, paths, communities, centrality, cascades) travels across the Internet, brain connectomes, food webs, and friendships with no loss of analytical power.

Broad Use¶

Universal in modeling interactions (e.g., social networks, neural networks, or transportation systems).

Clarity¶

Models connections and flows, e.g., social networks or transportation systems.

Manages Complexity¶

Models interactions systematically, capturing relationships rather than isolated elements.

Abstract Reasoning¶

Facilitates thinking about interconnected systems.

Knowledge Transfer¶

Applicable in biology (neurons), sociology (social graphs), and IT (network topology).

Example¶

A social media platform models friendships as a network, with individuals as nodes and relationships as edges.

Relationships to Other Abstractions¶

Current abstraction Network Prime

Foundational — no parent edges in the catalog.

Children (105) — abstractions linked here by typed relations

Active networking Domain-specific is a kind of Network

The architecture is a network whose nodes participate in programmable packet processing.
Aperiodic graph Domain-specific is a kind of Network

An aperiodic graph is a graph/network whose cycle-length structure has period one; Graph is a declared alias of the live Network Prime.
Biased Graph Domain-specific is a kind of Network

A biased graph is a vertex–edge connection structure with the additional theta-consistent balanced-cycle class.
Block Graph Domain-specific is a kind of Network

Block Graph is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Causal Map Domain-specific is a kind of Network

An attributed causal map is a directed network of factors and asserted influence links.

▸ Show 100 more

Central Executive Network Domain-specific is a kind of Network
The Central Executive Network is a functional network specialized to distributed frontoparietal coordination during goal-directed cognition.
Clique (Graph Theory) Domain-specific is a kind of Network
**Network** is the broader abstraction this entry instantiates.
Collaboration Graph Domain-specific is a kind of Network
A Collaboration Graph is a Network whose nodes are participants and whose edges encode a declared collaboration relation.
Comparability Graph Domain-specific is a kind of Network
A comparability graph is a node-and-edge network with the extra condition of a transitive edge orientation.
Complement graph Domain-specific is a kind of Network
Complement graph is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Conference graph Domain-specific is a kind of Network
A conference graph is a graph/network with a specified strongly regular parameter family; Graph is a declared alias of the live Network Prime.
Configuration Graph Domain-specific is a kind of Network
Configuration Graph is a domain-specific kind of network under its frozen identity and differentia.
Consumer network Domain-specific is a kind of Network
A consumer network is a network of consumers connected by influence, communication, or commercial relations.
Contact graph Domain-specific is a kind of Network
The resulting graph is literally a network of vertices linked by a pairwise relation; What makes it its own entry: the graph induced by a restrictive geometric touching relation and the existence of a compatible object representation, rather than unrestricted set intersection, proximity, graph drawing, or a graph product.
Convex bipartite graph Domain-specific is a kind of Network
Convex bipartite graph is a domain-specific kind of network under its frozen identity and differentia.
Cube-connected cycles Domain-specific is a kind of Network
What makes it its own entry: the domain-specific identity determined by the node and edge relation satisfies the bit-position construction and yields the declared cubic graph with n2^n vertices.
D-interval hypergraph Domain-specific is a kind of Network
D-interval hypergraph is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Degeneracy (graph theory) Domain-specific is a kind of Network
The candidate literally instantiates prime:network; What makes it its own entry: The least k such that every nonempty subgraph has a vertex of degree at most k, equivalently the maximum core number in a graph.
Dense Graph Domain-specific is a kind of Network
**Network** is the broader abstraction this entry instantiates.
Electrical network Domain-specific is a kind of Network
What makes it its own entry: An interconnection of idealized electrical elements whose node voltages and branch currents obey component laws and Kirchhoff conservation constraints.
Even-hole-free graph Domain-specific is a kind of Network
Even-hole-free graph is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Financial network Domain-specific is a kind of Network
A financial network is a network whose nodes are financial entities and whose links carry or mediate transactions.
Geodetic Graph Domain-specific is a kind of Network
Geodetic Graph is a strict kind of Network: it is a graph network whose stable differentia is a unique shortest path between every vertex pair.
Gradient Network Domain-specific is a kind of Network
Gradient Network is a domain-specific kind of network under the frozen identity and differentia.
Graph Power Domain-specific is a kind of Network
Graph Power is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Green infrastructure Domain-specific is a kind of Network
The abstraction organizes connected ecological assets and flows as a service network.
Interaction Nets Domain-specific is a kind of Network
The broader abstraction is live `prime:network`.
Interconnection Domain-specific is a kind of Network
What makes it its own entry: A network can be internally connected without interconnecting separate carriers, and a commercial relationship without a traffic-bearing interface is not interconnection.
Intersection graph Domain-specific is a kind of Network
It remains its own entry because its identity is fixed by the representing family and ambient universe, one-to-one vertex assignment, intersection predicate, treatment of self-intersection and multiplicity, graph direction and any restricted object class.
Kahn Process Networks Domain-specific is a kind of Network
**Network** is the broader abstraction this entry instantiates.
Kinetic Scheme Domain-specific is a kind of Network
**Network** is the strict parent because a kinetic scheme organizes state nodes and directed rate edges whose topology and weights generate flow.
Lattice graph Domain-specific is a kind of Network
The construction is literally a network of sites and local links.
Lollipop Graph Domain-specific is a kind of Network
Lollipop Graph is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Marine Protected Area Network Domain-specific is a kind of Network
A marine protected area network is a network specialized to ocean reserves and ecological transport.
Mathematical Flow Graph Domain-specific is a kind of Network
**Network — instantiates by strict subsumption.** Every member has directed nodes and weighted edges whose topology matters.
McKay Graph Domain-specific is a kind of Network
McKay Graph instantiates **Representation** because it maps a tensoring operator into a graph medium with an exact readback.
Modular graph Domain-specific is a kind of Network
What makes it its own entry: the domain-specific identity determined by the undirected connected graph and distance are fixed and for every vertex triple the intersection of all three pairwise shortest-path intervals is nonempty.
Moore graph Domain-specific is a kind of Network
A Moore graph is a graph/network attaining the degree-diameter Moore bound; Graph is a declared alias of the live Network Prime.
Multisite Cloud Domain-specific is a kind of Network
**Network** is the broader abstraction this entry instantiates.
P2PTV Domain-specific is a kind of Network
What makes it its own entry: the domain-specific identity determined by end-user peers materially redistribute stream data to other viewers while receiving it, under a protocol designed for time-sensitive playback.
Partial k-tree Domain-specific is a kind of Network
Partial k-tree strictly specializes **Network**: every instance is a graph-structured network, while most networks do not admit the specified bound.
Petri net Domain-specific is a kind of Network
The formalism is a directed network of state containers and events.
Pollination network Domain-specific is a kind of Network
It remains its own entry because its identity is fixed by the place and period, plant and pollinator node sets, interaction and effectiveness criteria, sampling effort, edge weights, temporal aggregation, taxonomic resolution, network metric and uncertainty.
Pulse-Coupled Neural Network Domain-specific is a kind of Network
A PCNN is an interacting network whose lateral connection pattern governs pulse influence.
Quantum Complex Network Domain-specific is a kind of Network
swapping and purification convert resource configurations.
Relational network theory Domain-specific is a kind of Network
What makes it its own entry: The proposed correspondence to cortical structures is a theoretical hypothesis, and the framework is not equivalent to generic neural networks or every usage-based linguistic model.
Rhizome (philosophy) Domain-specific is a kind of Network
Rhizome instantiates Network because it reasons through elements and connections whose topology changes available paths, while adding a specifically Deleuzian account of multiplicity, rupture, mapping, and hierarchy.
Rooted product of graphs Domain-specific is a kind of Network
A rooted product of graphs is itself a graph/network constructed from rooted component graphs.
Salience Network Domain-specific is a kind of Network
A salience network is a distributed network whose function arises from coordinated interactions among connected neural hubs.
Sequential Dynamical System Domain-specific is a kind of Network
**Network** is the most literal parent.
Sierpiński Graph Domain-specific is a kind of Network
Sierpiński graphs are networks with vertices and edges fixed by a recursive word-adjacency rule.
Skew-symmetric graph Domain-specific is a kind of Network
Skew-symmetric graph is a domain-specific kind of network under its frozen identity and differentia.
Social network (sociolinguistics) Domain-specific is a kind of Network
A sociolinguistic social network has speakers as nodes and interpersonal interaction ties linked to language-use patterns.
Social networks Domain-specific is a kind of Network
A social network is a network whose nodes are social actors and whose edges are social ties or interactions.
Strong connectivity augmentation Domain-specific is a kind of Network
The problem repairs reachability of a directed network.
Thermal energy network Domain-specific is a kind of Network
The infrastructure connects distributed thermal sources and loads through shared links.
Tier 1 Network Domain-specific is a kind of Network
**Network** is the broader abstraction this entry instantiates.
Tree (Graph Theory) Domain-specific is a kind of Network
A graph-theoretic tree is a network specialized to one connected, undirected, acyclic edge pattern with a unique path between every pair.
Tree toplology Domain-specific is a kind of Network
Tree toplology is a domain-specific kind of graph under its frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Trellis (graph) Domain-specific is a kind of Network
A trellis graph is a graph/network layered by time or symbol position; Graph is a declared alias of the live Network Prime.
Utility graph Domain-specific is a kind of Network
Utility graph is a domain-specific kind of network under its frozen identity and differentia.
Whisper Network Domain-specific is a kind of Network
A Whisper Network is a Network whose access-limited interpersonal links carry private warnings where formal reporting is absent or distrusted.
Directed Acyclic Graph Prime is a kind of Network
A DAG is a specific KIND of network/graph — directed edges plus a global no-return (acyclicity) constraint.
Hierarchy Prime is a kind of Network
Hierarchy is the restricted kind of Network whose edges impose asymmetric, transitive levels rather than an unrestricted connection pattern.
Teleconnection Prime is a kind of Network
A teleconnection is a kind of network relation in which distant nodes co-vary because both participate in a shared global mechanism.
Adversarial Queueing Network Domain-specific presupposes Network
Fixed packet routes and per-edge queue loads require an underlying directed connection graph.
Distributed Data Store Domain-specific includes Network
storage nodes communicate and fail through a network topology.
Eigenvector Centrality Domain-specific presupposes Network
Adjacency-based centrality presupposes a defined network relation.
Friendship Paradox Domain-specific presupposes Network
Friendship paradox presupposes a network because its node and edge distributions, degree variance, and nomination path exist only after tie-bearing edges define a connection pattern.
Global Language System Domain-specific includes Network
learning value rises with others' adoption and connectivity.
Karst Domain-specific includes Network
Karst contains the hidden conduit network that replaces surface-mapped drainage.
Key Informant Domain-specific presupposes, typical Network
Key-informant practice typically presupposes a network when centrality, brokerage, boundary spanning, or gatekeeping is what privileges an informant's vantage.
Larval Dispersal Domain-specific includes Network
Larval dispersal contains a directed connectivity network whose weighted edges are pairwise larval fluxes among source and sink populations.
Matching Domain-specific presupposes Network
Graph matching presupposes a network because its object is a subset of pairwise vertex-disjoint edges selected from an explicitly stated graph.
MPLS VPN Domain-specific includes Network
**`network`:** the service connects sites and forwarding elements through defined relations.
Network topology Domain-specific presupposes Network
Network topology structurally presupposes Network rather than being a subtype of it.
Pedestrian Shed Domain-specific includes Network
A pedestrian shed contains a walkable network whose nodes, edges, barriers, and weighted paths determine the reached polygon and distinguish it from a Euclidean circle.
Planarity Domain-specific presupposes Network
Planarity requires a Network or graph whose vertices and edges are the relational substrate being tested for a crossing-free embedding.
Routing Domain-specific presupposes Network
Routing computes and maintains paths by which a network delivers traffic to destinations.
Space syntax Domain-specific includes Network
Space syntax contains a network because it converts embodied spatial layout into nodes and intersections and computes integration and choice as graph centralities.
Urban Sprawl Domain-specific includes Network
Urban sprawl contains a network because arterial and collector roads link separated single-use zones and produce automobile dependence.
Watershed Domain-specific includes Network
A watershed contains a branching drainage network that merges tributary contributions.
Anastomosis Prime presupposes Network
Anastomosis presupposes a Network because it joins previously separate branches or channels so continuity or flow becomes available through more than one route.
Associative Memory Prime presupposes Network
Associative memory presupposes network because content-addressable retrieval through proximity in representational space requires a connection pattern over storage units.
Assortative Mixing Prime presupposes Network
The accepted reference-grade review places Assortative Mixing under Network because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Cascade Prime presupposes Network
Cascade presupposes Network: sequential propagation requires a connection pattern through which state changes can travel from element to element.
Client Server Model Prime presupposes Network
The client-server model is 'a directed topology laid over a network' — a network supplies nodes/edges, client-server adds initiation/addressability/multiplexing/capability asymmetries.
Connectedness Prime presupposes Network
'A network is the substrate — elements plus relations; connectedness is one PROPERTY of that substrate (is it one piece?).' It presupposes the network of elements-and-relations and reads only the reachability partition.
Cut Prime presupposes Network
A cut is a vertex-bipartition-plus-crossing-edges object DEFINED ON a network/graph; it presupposes a relational network.
Cycle Prime presupposes Network
Cycle presupposes Network, whose structure must already obtain for the child mechanism to be meaningful or operational.
Network Broker Role Prime presupposes Network
A positional property OF a network — presupposes a network substrate (nodes/ties with a source side and receiver side).
Network Flow Models Prime presupposes Network
Network flow models presupposes network because flows, capacities, and conservation are defined on the underlying graph of nodes and connections.
Network Traversal Prime presupposes Network
Network traversal presupposes a network because its visitable states and permitted next steps are defined by nodes and edges in an underlying relational structure.
Path Prime presupposes Network
'A path is one COMMITTED realization of a connection through the underlying relational substrate (a network)...
Percolation Threshold Prime presupposes Network
Defined on a network substrate of linkable sites; presupposes network (the relevant object is the connectivity graph).
Systemic Risk Prime presupposes Network
Systemic risk presupposes network because cascading whole-system failure depends on the topology and coupling of interconnected components.
Systems Thinking Prime presupposes Network
Systems thinking presupposes network because shifting analysis from elements to relationships and feedback requires viewing the system as a connection pattern.
Weak Ties Prime presupposes Network
Weak ties presupposes network because bridging value across structural holes is only definable against a connection pattern with clusters and gaps.
Cross-reference Relation Domain-specific is a decomposition of Network
Removing thesaurus vocabulary leaves curated nodes joined by directed, typed edges whose whole connection pattern determines reachability and navigability.
Graph Data Type Domain-specific is a decomposition of Network
Removing the in-memory interface and representation layer from a graph data type leaves network's substrate-neutral node-and-edge pattern.
Schema Mapping Relation Domain-specific is a decomposition of Network
Removing vocabulary semantics leaves a typed cross-scheme graph whose paths, weakest-link grades, reachability, and unmapped nodes remain first-class.
Tadpole diagram Domain-specific is a decomposition of Network
The loop and its one-line attachment retain a graph connectivity pattern after the physics interpretation is removed.
Cross-Impact Analysis Prime is a decomposition of Network
Cross-impact analysis is the specific shape network takes when nodes are future events or factors and edges are pairwise influence relations.
Social Capital Prime is a decomposition of Network
Social capital is the specific shape network takes when the connection pattern itself functions as a productive resource for the connected actors.
Task Interdependence Prime is a decomposition of Network
Task interdependence is the specific shape network takes when the nodes are tasks and the edges are workflow couplings of inputs, outputs, and resources.

Not to Be Confused With¶

Network is not Graph (Network) because Network focuses on the connection pattern and its structural properties (degree, clustering, reachability) in any domain as a first-class object for reasoning and measurement, whereas Graph formalizes the abstract (V, E) mathematical pair with emphasis on discrete combinatorial properties independent of substrate application.
Network is not Network Effect because Network studies the structural topology itself — who is connected to whom and what flows through those connections — while Network Effect studies the economic and adoption phenomenon of value increasing with user population, a dynamic property that can occur on networks but not a structural property of network topology.
Network is not Relation because Network presumes pairwise connections making structural properties salient and measurable (paths, degree, clustering, reachability), whereas Relation is a purely algebraic object defined as a subset of a Cartesian product with no inherent spatial, topological, or measurement structure.