← All models Association topology Topology family original random modular rings
original
Frontal memories ↓ · posterior memories →
Frontal 0 ↔ posterior 0 · weight 1.0000 Frontal 1 ↔ posterior 1 · weight 1.0000 Frontal 2 ↔ posterior 2 · weight 1.0000 Frontal 3 ↔ posterior 3 · weight 1.0000 Frontal 4 ↔ posterior 4 · weight 1.0000 Frontal 5 ↔ posterior 5 · weight 1.0000 Frontal 6 ↔ posterior 6 · weight 1.0000 Frontal 7 ↔ posterior 7 · weight 1.0000 Frontal 8 ↔ posterior 8 · weight 1.0000 Frontal 9 ↔ posterior 9 · weight 1.0000 Frontal 10 ↔ posterior 10 · weight 1.0000 Frontal 11 ↔ posterior 11 · weight 1.0000 Frontal 12 ↔ posterior 12 · weight 1.0000 Frontal 13 ↔ posterior 13 · weight 1.0000 Frontal 14 ↔ posterior 14 · weight 1.0000 Frontal 15 ↔ posterior 15 · weight 1.0000 Frontal 16 ↔ posterior 16 · weight 1.0000 Frontal 17 ↔ posterior 17 · weight 1.0000 Frontal 18 ↔ posterior 18 · weight 1.0000 Frontal 19 ↔ posterior 19 · weight 1.0000 Frontal 20 ↔ posterior 20 · weight 1.0000 Frontal 21 ↔ posterior 21 · weight 1.0000 Frontal 22 ↔ posterior 22 · weight 1.0000 Frontal 23 ↔ posterior 23 · weight 1.0000 Frontal 24 ↔ posterior 24 · weight 1.0000 Frontal 25 ↔ posterior 25 · weight 1.0000 Frontal 26 ↔ posterior 26 · weight 1.0000 Frontal 27 ↔ posterior 27 · weight 1.0000 Frontal 28 ↔ posterior 28 · weight 1.0000 Frontal 29 ↔ posterior 29 · weight 1.0000 Frontal 30 ↔ posterior 30 · weight 1.0000 Frontal 31 ↔ posterior 31 · weight 1.0000 Frontal 32 ↔ posterior 32 · weight 1.0000 Frontal 33 ↔ posterior 33 · weight 1.0000 Frontal 34 ↔ posterior 34 · weight 1.0000 Frontal 35 ↔ posterior 35 · weight 1.0000 Frontal 36 ↔ posterior 36 · weight 1.0000 Frontal 37 ↔ posterior 37 · weight 1.0000 Frontal 38 ↔ posterior 38 · weight 1.0000 Frontal 39 ↔ posterior 39 · weight 1.0000 Frontal 40 ↔ posterior 40 · weight 1.0000 Frontal 41 ↔ posterior 41 · weight 1.0000 Frontal 42 ↔ posterior 42 · weight 1.0000 Frontal 43 ↔ posterior 43 · weight 1.0000 Frontal 44 ↔ posterior 44 · weight 1.0000 Frontal 45 ↔ posterior 45 · weight 1.0000 Frontal 46 ↔ posterior 46 · weight 1.0000 Frontal 47 ↔ posterior 47 · weight 1.0000 Frontal 48 ↔ posterior 48 · weight 1.0000 0 0 7 7 14 14 21 21 28 28 35 35 42 42 49 + 49 memories · 1 link per memory · weight 1/1
Redundancy R 4 R_4 R 4 ⓘ 0.000 Counts four-edge cycles: two frontal memories sharing two posterior neighbours. The score is log(1 + cycle count). Higher values mean more shared associations.
Four-edge cycles N₄ = 0.
B is the binary frontal × posterior matrix; k is its degree.
Modularity Q ∗ Q^* Q ∗ ⓘ 0.980 Barber bipartite modularity, estimated by a fixed-restart greedy search. Higher values mean stronger communities compared with a degree-preserving null. The original reference has degree one; its score is calculated with that degree and should be interpreted separately.
B is the binary frontal × posterior matrix; k is its degree.
Mixing gap γ \gamma γ ⓘ 0.000 Spectral gap of a two-step memory walk. σ₂ is the second singular value of the normalized association matrix. A larger gap means faster mixing; zero indicates disconnected components.
B is the binary frontal × posterior matrix; k is its degree.
Hover or focus a score for its definition and equation.
Purple squares are reciprocal associations. Each row has total weight 1: the many-to-many graphs distribute it across seven neighbours.
Frontal 0 0.25 0.5 0.75 1 0 1 Time (network sweeps) Memory overlap Start a simulation to see the memory overlaps.
Posterior 0 0.25 0.5 0.75 1 0 1 Time (network sweeps) Memory overlap Start a simulation to see the memory overlaps. 256 units and 49 fresh random memories per region. Colours identify memory indices; read the matrix to see their associations.
Model and run details Adaptation tracks state activity σ. Fast and slow activity-dependent inhibition use T₃A = 10, T₃B = 100000 and γA = 0.5, as in the heterogeneous model.
λ scales intra-area connections by (1 + λ) and incoming inter-area connections by (1 − λ). At λ = 1 the region receives no inter-area input. Each region receives its own transient cue: a selected stored memory or a fresh, unstored random pattern. Cue strength is 5 and decays with a 40-sweep time scale; it is removed after 360 sweeps.
Every Start regenerates both memory sets, unit connection dilution and update tables, then uses a fresh runtime seed. The selected association graph and its scores remain fixed.
Entire network Shared by both regions.