• Corpus ID: 221397084

The Eigenvalue Distribution of the Watt-Strogatz Random Graph

  title={The Eigenvalue Distribution of the Watt-Strogatz Random Graph},
  author={Poramate Nakkirt},
  journal={arXiv: Probability},
  • Poramate Nakkirt
  • Published 1 September 2020
  • Mathematics, Computer Science
  • arXiv: Probability
This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has exactly k neighbors with equally k/2 edges on each side. With probability p, each downside neighbor of a particular vertex will rewire independently to a random vertex on the graph without allowing for self-loops or duplication. The rewiring process starts… 

Figures and Tables from this paper

Eigenvalues for the transition matrix of a small-world scale-free network: Explicit expressions and applications.

The eigenvalues for the transition matrix of a network that is simultaneously scale-free, small-world, and clustered are studied to determine the mixing time and random target access time for random walks and are applied to count spanning trees in the network.

On the properties of small-world network models

Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties

Statistical mechanics of complex networks

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

A simple, distance-dependent formulation of the Watts-Strogatz model for directed and undirected small-world networks

This work describes an alternative formulation of the WS model in terms of a distance-dependent probability of connection that further simplifies, both practically and theoretically, the generation of directed and undirected WS-type small-world networks.


Based on the reviewed Erdos-Renyi, Watts-Strogatz and Barabasi-Albert models, a new model can be developed, that better describes the unique characteristics of the biggest and most complex network Internet.

Topics in Random Matrix Theory

The field of random matrix theory has seen an explosion of activity in recent years, with connections to many areas of mathematics and physics. However, this makes the current state of the field

Small worlds: the dynamics of networks between order and randomness

    Jie Wu
    Computer Science
  • 2002
Duncan Watts uses the small-world phenomenon--colloquially called "six degrees of separation"--as a prelude to a more general exploration: under what conditions can a small world arise in any kind of network?

The Structure and Function of Complex Networks

Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.