small-world network in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "forms": [
    {
      "form": "small-world networks",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "small-world network"
      },
      "expansion": "small-world network (plural small-world networks)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A kind of graph in which most nodes are not neighbors but most can be reached from every other by a small number of steps, i.e. the typical distance between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes in the network."
      ],
      "id": "en-small-world_network-en-noun-TzDwK5hx",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "node",
          "node"
        ],
        [
          "neighbor",
          "neighbor"
        ],
        [
          "step",
          "step"
        ],
        [
          "proportional",
          "proportional"
        ],
        [
          "logarithm",
          "logarithm"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A kind of graph in which most nodes are not neighbors but most can be reached from every other by a small number of steps, i.e. the typical distance between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes in the network."
      ],
      "related": [
        {
          "word": "it's a small world"
        },
        {
          "word": "small-worldness"
        },
        {
          "word": "small-world phenomenon"
        }
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "small-world network"
      ]
    }
  ],
  "word": "small-world network"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "forms": [
    {
      "form": "small-world networks",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "small-world network"
      },
      "expansion": "small-world network (plural small-world networks)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "it's a small world"
    },
    {
      "word": "small-worldness"
    },
    {
      "word": "small-world phenomenon"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Mathematics"
      ],
      "glosses": [
        "A kind of graph in which most nodes are not neighbors but most can be reached from every other by a small number of steps, i.e. the typical distance between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes in the network."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "node",
          "node"
        ],
        [
          "neighbor",
          "neighbor"
        ],
        [
          "step",
          "step"
        ],
        [
          "proportional",
          "proportional"
        ],
        [
          "logarithm",
          "logarithm"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A kind of graph in which most nodes are not neighbors but most can be reached from every other by a small number of steps, i.e. the typical distance between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes in the network."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "small-world network"
      ]
    }
  ],
  "word": "small-world network"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.

"small-world network" meaning in English

Noun

Inflected forms