Integer Networks
arXiv:cond-mat/0405258 · doi:10.1016/j.physa.2005.11.011
Abstract
Inspired by Pythagoras's belief that numbers are the absolute reality, we obtain some demonstrational results about topological properties of integer networks, in which the vertices represent integers and two vertices are neighbors if and only if there exists a divisibility relation between them. We strictly prove that the diameter of networks has a constant upper bound independent to the network size , which is completely different from the extensively studied real-life networks with their average distance increasing logarithmically to as or . Further more, the integer networks is high clustered, with clustered coefficient , and display power-law degree distribution of exponent .
3 pages, 4 figures
References in corpus (4)
- The structure and function of complex networks
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
- Families and clustering in a natural numbers network
Cited by in corpus (14)
- Relations between Average Distance, Heterogeneity and Network Synchronizability
- High dimensional random Apollonian networks
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Evolving Apollonian Networks with Small-world Scale-free topologies
- A general geometric growth model for pseudofractal scale-free web
- A general model for collaboration networks
- Exploring complex networks via topological embedding on surfaces
- Multiplex congruence network of natural numbers
- Deterministic weighted scale-free small-world networks
- Divisibility patterns of natural numbers on a complex network
- Phase transition in a stochastic prime number generator
- Diophantine Networks
- Deterministic scale-free networks created in a recursive manner
- Structure Properties of Koch Networks Based on Networks Dynamical Systems