Diophantine Networks

Abstract

We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by representing integers as vertices and by drawing cliques between M vertices every time that M distinct integers satisfy the equation. We analyse the network generated by the Pythagorean equation $x^2+y^2=z^2$ showing that its degree distribution is well approximated by a power law with exponential cut-off. We also show that the properties of this network differ considerably from the features of scale-free networks generated through preferential attachment. Remarkably we also recover a power law for the clustering coefficient.

References in corpus (16)

• Statistical mechanics of complex networks
• Error and attack tolerance of complex networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Universal Behavior of Load Distribution in Scale-free Networks
• Connectivity of Growing Random Networks
• Identity and Search in Social Networks
• Organization of Growing Random Networks
• Degree Distributions of Growing Networks
• Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-Free Networks
• Growing Random Networks with Fitness
• Network properties of written human language
• High Dimensional Apollonian Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• Integer Networks
• Growing distributed networks with arbitrary degree distributions
• Structure of n-clique networks embedded in a complex network

Cited by in corpus (2)

• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions