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 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.
Recommendations
Cites work
- An Omega theorem on Pythagorean triples
- Fitness versus longevity in age-structured population dynamics
- Growing random networks with fitness
- High-dimensional Apollonian networks
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 98709 (Why is no real title available?)
- On the distribution of Pythagorean triangles
- Pythagorean triangles with legs less than \(n\)
- Statistical mechanics of complex networks
Cited in
(2)
This page was built for publication: Diophantine networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1672934)