EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Clustering compresses attractors in Watts–Strogatz threshold Boolean networks

Maram Alqarni, Mark Cooper, Diane Donovan, James Lefevre

Journal of Complex Networks · 29.06.2026 · 14 (4)

DOI: 10.1093/comnet/cnag027 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 29.06.2026. Verfasst von Maram Alqarni und 3 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Australian Research Council, ARC Centre of Excellence for Plant Success in Nature and Agriculture.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Does higher clustering shorten attractor periods? We examine whether the global clustering coefficient $ \symbf{C} $, a direct measure of triangle density, predicts attractor lengths in synchronous, signed-threshold Boolean networks on Watts–Strogatz (WS) graphs. We generate 330 directed, signed WS networks spanning sizes $ \symbf{N\,=\,10-100} $ and mean degrees $ \symbf{\bar{k}=2-10} $, simulate dynamics from $ \symbf{M\,=\,100} $ random initial states per graph with exact attractor detection, and summarize each graph by the average log attractor period (equivalently, the geometric mean period). Our primary analysis relates this log-period summary to $ \symbf{C} $ while adjusting for $ \symbf{N} $, $ \symbf{\bar{k}} $, the mean directed shortest path, and including nonlinear size–degree and clustering–degree interactions. Higher clustering robustly shortens attractor periods: a 0.10 increase in $ \symbf{C} $ ($ \symbf{C\in[0,1]} $) corresponds to an $ \symbf{{\approx 13\%-14\%}} $ lower expected geometric mean period, and moving from $ \symbf{C\,=\,0.000} $ to $ \symbf{C\,=\,0.460} $ yields an $ \symbf{\approx 50\%} $ reduction, holding other properties fixed. The effect persists when the linear $ \symbf{C} $ term is replaced by a nonlinear function of $ \symbf{C} $, and it replicates in held-out graph instances (graphs not used to fit the model). Shorter periods are not explained by an increase in fixed points under the strict comparator ($ \symbf{\gt} $); rather, higher triangle density shifts mass from long periods to medium-length periods. In threshold-like logic, settling speed and oscillatory stability are central to computation and control. Our results provide a direct, quantitative link between triangle density and these long-run behaviours, showing that $ \symbf{C} $ acts as a structural lever on temporal complexity.

Förderung

  • Australian Research Council
  • ARC Centre of Excellence for Plant Success in Nature and Agriculture

Zitieren

APA

Alqarni, M., Cooper, M., Donovan, D., & Lefevre, J. (2026). Clustering compresses attractors in Watts–Strogatz threshold Boolean networks. Journal of Complex Networks, 14(4). https://doi.org/10.1093/comnet/cnag027

Vancouver

Alqarni M, Cooper M, Donovan D, Lefevre J. Clustering compresses attractors in Watts–Strogatz threshold Boolean networks. Journal of Complex Networks. 2026;14(4). doi:10.1093/comnet/cnag027

BibTeX
@article{Alqarni2026,
  author = {Alqarni, Maram and Cooper, Mark and Donovan, Diane and Lefevre, James},
  title = {Clustering compresses attractors in Watts–Strogatz threshold Boolean networks},
  journal = {Journal of Complex Networks},
  year = {2026},
  volume = {14},
  number = {4},
  doi = {10.1093/comnet/cnag027}
}
Kostenlos starten →