Collective patterns on graphs

  • Understanding how collective patterns emerge on graphs is a fundamental challenge across disciplines, from biological and ecological networks to computational and physical systems. This thesis explores the interplay between network topology and emergent dynamics using minimal models and spectral graph techniques. A first investigation focuses on network inference, showing that Turing patterns encode structural information about the underlying graph, which we use to infer missing links. The second study investigates multistability in reaction-diffusion networks, showing how local spectral gaps influence the attractor landscape of Turing patterns using a heuristic binary classification algorithm. Finally, the third study applies the sandpile model to soil erosion processes, bridging concepts from self-organised criticality and connectivity-based geomorphology to investigate the role of minimal models in empirical research. This thesis combines theoretical analysis, computational modelling and empirical validation to highlight how structure shapes dynamics across different contexts and illustrate the potential of minimal models as predictive, explanatory and exploratory tools for complex systems.

Download full text files

Export metadata

Additional Services

Metadata
Author:Selim Haj Ali
URN:urn:nbn:de:gbv:579-opus-1013217
Referee:Marc-Thorsten Hütt, Laura Turnbull, Stefan Kettemann
Advisor:Marc-Thorsten Hütt
Document Type:Doctoral Thesis
Language:English
Date of first Publication:2026/03/30
Publishing Institution:IRC-Library, Information Resource Center der Constructor University
Granting Institution:Constructor Univ.
Date of final exam:2025/04/23
Release Date:2026/03/30
Tag:Complex systems; Functional connectivity; Laplacian graph spectrum; Network science; Self-organization
PhD degrees:Physics
country:United Kingdom
Academic Departments:School of Science