{
  "id": "enwiki-001315447731",
  "slug": "sparse-network",
  "title": "Sparse network",
  "qid": "",
  "lead": "In network science, a sparse network has much fewer links than the possible maximum number of links within that network (the opposite is a dense network). The study of sparse networks is a relatively new area primarily stimulated by the study of real networks, such as social and computer networks. The notion of much fewer links is, of course, colloquial and informal. While a threshold for a particular network may be invented, there is no universal threshold that defines what much fewer actually means. As a result, there is no formal sense of sparsity for any finite network, despite widespread agreement that most empirical networks are indeed sparse. There is, however, a formal sense of sparsity in the case of infinite network models, determined by the behavior of the number of edges (L) and/or the average degree ( ) as the number of nodes (N) goes to infinity.",
  "body": "In network science, a sparse network has much fewer links than the possible maximum number of links within that network (the opposite is a dense network). The study of sparse networks is a relatively new area primarily stimulated by the study of real networks, such as social and computer networks. The notion of much fewer links is, of course, colloquial and informal. While a threshold for a particular network may be invented, there is no universal threshold that defines what much fewer actually means. As a result, there is no formal sense of sparsity for any finite network, despite widespread agreement that most empirical networks are indeed sparse. There is, however, a formal sense of sparsity in the case of infinite network models, determined by the behavior of the number of edges (L) and/or the average degree ( ) as the number of nodes (N) goes to infinity. L \\ll L_{max} = {N\\choose 2} . In any given (real) network, the number of nodes N and links L are just two numbers, therefore the meaning of the much smaller sign ( \\ll above) is purely colloquial and informal, and so are statements like \"many real networks are sparse.\" However, if we deal with a synthetic graph sequence G_{N} , or a network model that is well defined for networks G_{N} of any size N = 1,2,..., \\infty , then the \\ll attains its usual formal meaning: L \\ll L_{max} \\iff L = o(L_{max}) \\iff \\lim_{N\\rightarrow\\infty}\\frac{L}{L_{max}}=0 . In other words, a network sequence or model G_N is called dense or sparse depending on whether the (expected) average degree \\langle k\\rangle = 2L/N in G_N scales linearly or sublinearly with N: G_N is dense if \\langle k\\rangle = O(N) ; G_N is sparse if \\langle k\\rangle = o(N) . An important subclass of sparse networks are networks whose average degree is either constant or converges to a constant. Some authors call only such networks sparse, while others reserve special names for them: G_N is truly sparse or extremely sparse or ultrasparse if \\langle k\\rangle = O(1) . There also exist alternative, stricter definitions of network sparsity requiring the convergence of the degree distribution in G_N to a well defined limit at N \\rightarrow \\infty . According to this definition, the N-star graph S_N , for example, is not sparse. ==References==",
  "categories": [
    "23374305",
    "29176511",
    "29176512"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1315447731",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1759769117.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001315447731",
    "type": "webpage",
    "title": "Sparse network",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/sparse-network",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001315447731",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1315447731",
    "note": "Immutable snapshot enwiki-001315447731"
  }
}