Logarithmic binning of edge weights turns weighted food webs into graphs where automorphisms appear, and the resulting orbits are almost always of size two or three.
Symmetry and Self-Organization in Complex Systems
1 Pith paper cite this work, alongside 11 external citations. Polarity classification is still indexing.
abstract
We show that, in contrast to classical random graph models, many real-world complex systems -- including a variety of biological regulatory networks and technological networks such as the internet -- spontaneously self-organize to a richly symmetric state. We consider the organizational origins of symmetry and find that growth with preferential attachment confers symmetry in highly branched networks. We deconstruct the automorphism group of some real-world networks and find that some, but not all, real-world symmetry can be accounted for by branching. We also uncover an intriguing correspondence between the size of the automorphism group of growing random trees and the random Fibonacci sequences.
citation-role summary
citation-polarity summary
fields
physics.soc-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Symmetries of weighted networks: weight approximation method and its application to food webs
Logarithmic binning of edge weights turns weighted food webs into graphs where automorphisms appear, and the resulting orbits are almost always of size two or three.