"small-world network" meaning in All languages combined

{
  "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"
}

{
  "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"
}