Symmetries of weighted networks: weight approximation method and its application to food webs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Korol, Julia, Iskrzyński, Mateusz
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911005131407360
author Korol, Julia
Iskrzyński, Mateusz
author_facet Korol, Julia
Iskrzyński, Mateusz
contents Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted networks, edge weights are rarely equal, making exact symmetry uncommon. To study symmetries in weighted networks, we aggregate edge weights into a small number of discrete categories. The symmetries of these aggregated networks identify vertices with similar roles in the original weighted network. In food webs, this approach helps to quantify ecological co-existence and competition by assessing the functional substitutability of species. We apply our method to 250 empirical food webs, finding that symmetric vertices emerge even under weak approximations, typically forming small orbits of size two or three. These symmetric vertices can appear at any trophic level or network position. We also apply three symmetry measures to compare structural patterns at the network level.
format Preprint
id arxiv_https___arxiv_org_abs_2506_11824
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Symmetries of weighted networks: weight approximation method and its application to food webs
Korol, Julia
Iskrzyński, Mateusz
Physics and Society
Social and Information Networks
Molecular Networks
Populations and Evolution
Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted networks, edge weights are rarely equal, making exact symmetry uncommon. To study symmetries in weighted networks, we aggregate edge weights into a small number of discrete categories. The symmetries of these aggregated networks identify vertices with similar roles in the original weighted network. In food webs, this approach helps to quantify ecological co-existence and competition by assessing the functional substitutability of species. We apply our method to 250 empirical food webs, finding that symmetric vertices emerge even under weak approximations, typically forming small orbits of size two or three. These symmetric vertices can appear at any trophic level or network position. We also apply three symmetry measures to compare structural patterns at the network level.
title Symmetries of weighted networks: weight approximation method and its application to food webs
topic Physics and Society
Social and Information Networks
Molecular Networks
Populations and Evolution
url https://arxiv.org/abs/2506.11824