# Exactly solvable small-world network

@article{Dorogovtsev2000ExactlySS, title={Exactly solvable small-world network}, author={Sergey N. Dorogovtsev and Jos{\'e} F. F. Mendes}, journal={EPL}, year={2000}, volume={50}, pages={1-7} }

We present an exact description of a crossover between two different regimes of simple small-world networks. Each of the sites chosen with a probability p from n sites of an ordered system defined on a circle is connected to all other sites selected in such a way. Every link is of a unit length. While p changes from 0 to 1, an averaged shortest distance between a pair of sites changes from ~ n to = 1. We find the distribution of the shortest distances P(l) and obtain a scaling form of (p,n). In… Expand

#### 71 Citations

A realistic substrate for Small-world networks modeling

- Computer Science
- 12th International Workshop on Database and Expert Systems Applications
- 2001

A new regular substrate is presented that models more accurately topologies with certain hierarchical properties and the dynamics of the diffusion of information packages over the network for different types of network substrates is investigated. Expand

A deterministic small-world network created by edge iterations

- Mathematics, Physics
- 2006

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… Expand

A new small-world network created by Cellular Automata

- Mathematics
- 2016

In this paper, we generate small-world networks by the Cellular Automaton based on starting with one-dimensional regular networks. Besides the common properties of small-world networks with small… Expand

Deterministic scale-free networks

- Computer Science, Physics
- 2001

This work proposes a simple model that generates scale-free networks in a deterministic fashion, and solves exactly the model, showing that the tail of the degree distribution follows a power law. Expand

Structure of growing networks with preferential linking.

- Physics, Medicine
- Physical review letters
- 2000

The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal. Expand

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

- Physics
- 2006

Based on the model of the same degree of all nodes we proposed before, a new algorithm, the so-called ``spread all over vertices" (SAV) algorithm, is proposed for generating small-world properties… Expand

Small worlds: how and why.

- Computer Science, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2001

This work uses simulated annealing to study the properties of a randomly rewired network as the relative tradeoff between wiring and connectivity is varied, and finds an alternate route to small-world behavior through the formation of hubs, small clusters where one vertex is connected to a large number of neighbors. Expand

Small-world network models and their average path length

- Mathematics
- 2014

Small-World Network Models and Their Average Path Length Samah Taha Department of Mathematical Sciences, University of Stellenbosch, Private Bag X1, Matieland 7602, South Africa. Thesis: April 2014… Expand

Markov chain approach to anomalous diffusion on Newman–Watts networks

- Mathematics, Physics
- Journal of Statistical Mechanics: Theory and Experiment
- 2019

A Markov chain (MC) formalism is used to investigate the mean-square displacement (MSD) of a random walker on Newman-Watts (NW) networks. It leads to a precise analysis of the conditions for the… Expand

J un 2 00 1 Evolution of random networks

- 2002

We review a recent fast progress in statistical physics of evolving networks. Interest focuses mainly on the structure properties of random hierarchically organized networks in communications,… Expand

#### References

SHOWING 1-10 OF 16 REFERENCES

Small worlds

- Computer Science, Mathematics
- Random Struct. Algorithms
- 2001

This paper considers some particular instances of small world models, and rigorously investigates the distribution of their inter-point network distances, framed in terms of approximations, whose accuracy increases with the size of the network. Expand

Eur. Phys. J. B

- Eur. Phys. J. B
- 1999

Phys. Rev. E

- Phys. Rev. E
- 1999

Phys. Rev. E

- Phys. Rev. E
- 1999

Phys. Rev. E

- Phys. Rev. E
- 1999

Phys. Rev. Lett. Phys. Rev. Lett

- Phys. Rev. Lett. Phys. Rev. Lett
- 1999

Small Worlds (Princeton

- 1999

Submitted to Phys.Rev.Lett.

- 1996