Spider networks

TL;DR

This paper explores a family of networks called spiders, analyzing their properties as small-world networks based on varying parameters like core size, number of legs, and leg length.

Contribution

It introduces the concept of spider networks and investigates their small-world properties across different parameter configurations.

Findings

Spiders can exhibit small-world characteristics under certain parameter settings.

The network structure transitions from chains to complete graphs as parameters vary.

The study provides insights into how network parameters influence small-world behavior.

Abstract

In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of legs at each core node, and the length of these legs. Keeping two of the three parameters constant we investigate if spiders are small worlds in the sense recently defined by Egghe.