Rules, agents and order
Description
This dataset contains the computational outputs, code, pseudocode, models and visual resources used in the study "Rules, Agents and Order". The paper explores how the interplay of global selection rules and special agents in evolving complex networks gives rise to global structural order, contrasting several link-adding models including Erdős–Rényi, Preferential Attachment, Achlioptas processes, Modified Chip-Firing Models, and Intracellular Network Evolution Processes. These resources support the reproducibility of results and facilitate further research into topology-functionality relationships in finite-size complex systems.
Files
Steps to reproduce
This dataset includes the code, pseudocode, model implementations, and output data used in the study. Structure and Contents: > Codes (Standard Graph Models) This section contains Python code implementing the classical network evolution models: -ER (Erdős–Rényi) -AB (Albert-Barabasi/Preferential Attachment) -Achlioptas Process > Codes (INEP and MCFM) This section contains pseudo-code and the implementation of the network evolution models. > Data (INEP and MCFM) The folder outputs.zip contains subfolders for each model: -out (net.edgelist or edges.dat): Edge list data representing the final winning network at each generation. For INEP, this includes in/out/catalytic roles. -HUBS: Lists of top hub nodes by degree, recorded at generations 50, 500, and 1999. -HITS: Lists of top nodes ranked by HITS algorithm (hub and authority scores), also recorded at generations 50, 500, and 1999. Also there are some figures of the outputs.