A deterministic small-world network created by edge iterations
classification
❄️ cond-mat.stat-mech
keywords
networkssmall-worldmodeldeterministicnetworkappropriatecharacteristicscommunication
read the original abstract
Small-world networks are ubiquitous in real-life systems. Most previous models of small-world networks are stochastic. The randomness makes it more difficult to gain a visual understanding on how do different nodes of networks interact with each other and is not appropriate for communication networks that have fixed interconnections. Here we present a model that generates a small-world network in a simple deterministic way. Our model has a discrete exponential degree distribution. We solve the main characteristics of the model.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.