Homogeneous network

A network in which all nodes, all links, or both share the same relevant type or properties. It contrasts with a heterogeneous network, which combines distinct types.

Connect

Graph theory: The mathematical study of graphs, structures made of vertices and edges. Homogeneity is defined by properties assigned to a graph’s vertices or edges.
Heterogeneous network: A network containing multiple relevant types of nodes, links, or both. It is the direct counterpart when a network combines distinct types.
Erdős–Rényi model: A random graph model in which each possible edge is included independently with a fixed probability. It models networks with a single class of nodes and uniform edge probability.
Degree distribution: The probability distribution of the number of connections attached to a node in a network. Degree variation can remain substantial even when node and link types are homogeneous.
Vertex (graph theory): A vertex is a point in a graph, also called a node. A network may be homogeneous because its vertices share a relevant type.
Multiplex network: A network in which the same nodes are connected through multiple types of relations or layers. Its distinct relation layers can violate homogeneity of links.
Watts–Strogatz model: A random graph model combining local clustering with short average path lengths. Its standard form treats nodes and links as one type while varying connectivity.
Network diffusion: The spread of information, behavior, or disease through connections in a network. Homogeneity assumptions affect predictions about how quickly diffusion spreads.
Edge (graph theory): An edge is a connection between two vertices in a graph. A network may instead be homogeneous because its connections share a relevant type.
Bipartite graph: A graph whose vertices divide into two sets, with edges only between sets. Its two structurally distinct vertex sets make it a common nonhomogeneous case.