Graph Dynamics Lab is a research-oriented simulation framework for exploring
information propagation, correlation, and entanglement-like dynamics on graphs.
The project is quantum-inspired, but deliberately avoids full quantum formalisms
(Qiskit, density matrices, etc.) in favor of transparent, interpretable models
built from first principles.
Graphs are a universal abstraction:
- physical systems
- data networks
- information flow
- interaction structures
This project treats a graph not as static topology, but as a dynamical system
where:
- nodes carry state amplitudes
- edges define interaction rules
- global behavior emerges from local rules
The goal is understanding dynamics, not maximizing performance.
- adjacency matrix with real or complex weights
- directed or undirected edges
- no external graph libraries (custom implementation)
- each node holds a value (real or complex)
- full state is a normalized vector
- normalization enforces physical consistency
- deterministic linear evolution rule
- graph acts as an operator on the state
- no hidden randomness
- discrete time steps
- full state history is preserved
- enables post-analysis (entropy, correlation, entanglement)
The system is analyzed using information-theoretic and relational measures:
- Shannon entropy of node probabilities
- tracks information spreading and l
Possible extensions include:
larger and heterogeneous graphs
directed phase-asymmetric dynamics
persistent state logging (CSV / JSON)
C# front-end integration
comparative studies of graph topologies