| Crates.io | divisor_networks |
| lib.rs | divisor_networks |
| version | 0.1.0 |
| created_at | 2024-06-24 19:17:00.125519+00 |
| updated_at | 2024-06-24 19:17:00.125519+00 |
| description | Discrete Graphs for Indiscrete Researchers - Networks with Grothendieck Topology. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1282461 |
| size | 48,957 |
DivisorNetworksDivisorNetworks is a Rust package designed for graph modeling and simulations. This library aims to provide a robust framework for analyzing and understanding discrete graph networks such as Hopfield networks and chip-firing models. It's currently a work in progress.
Modular design with a basis in category theory and Grothendieck topology.
Integration with sheaf theory for consistency and advanced analysis.
Flexible simulation framework for Hopfield networks and chip-firing systems.
Rust implementation - potential for future Python bindings.
src/category - Defines category theoeretic structure and Grothendieck topology.src/graph - Contains the graph structures and node implementations.src/sheaf - Manages sheaf and presheaf data, along with sheaf conditions.src/simulation - Simulation logic for Hopfield networks and chip-firing systems.UCL Human Electrophysiology Lab: https://bushlab-ucl.github.ioCrates.io: https://crates.io/crates/divisor-networksSGA 1972: https://stacks.math.columbia.edu/tag/00WY