Skip to content

Build · Initialization

Topology catalog

Every registered topology, graph-based and matrix-based. Each page shows the connectivity portrait, the weight matrix, the parameters, and the code to use it in a reservoir layer.

  • antisymmetric

    Build a random antisymmetric (skew-symmetric) matrix :math:A - A^\top.

  • band

    Build a deterministic banded recurrent matrix of constant weight.

  • barabasi_albert

    Generates a Barabási-Albert scale-free network.

  • block_diagonal

    Build a block-diagonal recurrent matrix of constant-valued blocks.

  • chord_dendrocycle

    Dendrocycle + optional small-world chords on the core ring.

  • complete

    Generates a complete (undirected) graph of n nodes.

  • connected_erdos_renyi

    Generates a connected Erdos-Renyi graph.

  • connected_watts_strogatz

    Generates a connected Watts-Strogatz graph.

  • cycle_jumps

    Build a simple cycle augmented with regularly spaced bidirectional jumps.

  • delay_line

    Build a pure delay-line recurrent matrix (a single sub-diagonal).

  • delay_line_backward

    Build a delay line with an added backward (super-diagonal) connection.

  • dendrocycle

    Construct a directed dendrocycle graph with optional small-world chords on the core ring.

  • erdos_renyi

    Generates an Erdos-Renyi (G(n, p)) graph.

  • fast_spectral_initialization

    Build a recurrent matrix at a target spectral radius without eigvals.

  • kleinberg_small_world

    Generates a 2D Kleinberg small-world graph on an n x n toroidal grid.

  • multi_cycle

    Build a Simple Multi-Cycle Reservoir (SMCR) topology as a NetworkX DiGraph.

  • newman_watts_strogatz

    Generates a Newman-Watts-Strogatz small-world graph.

  • orthogonal

    Build a random orthogonal matrix via QR decomposition.

  • random

    Generate a random directed graph with a given density.

  • regular

    Generates a regular ring-lattice graph (each node has k neighbors).

  • ring_chord

    Generates a small-world digraph with a ring and backward chords. - ring edges i -> (i+1) mod n with weight 1.0 - backward chords i -> (i - L

  • self_loop_cycle

    Build a unidirectional cycle with a self-loop on every node.

  • simple_cycle

    Build a unidirectional cycle (ring) recurrent matrix.

  • simple_cycle_jumps

    Generate a directed cycle with bidirectional jumps.

  • spectral_cascade

    Generates a graph of N disconnected components (cliques) of sizes 1..N, where n = N(N+1)/2. Each clique is fully connected (or complete in t

  • toeplitz

    Build a deterministic Toeplitz recurrent matrix (constant per diagonal).

  • watts_strogatz

    Generates a Watts-Strogatz small-world graph.

  • zeros

    Create the zero (edgeless) graph with n nodes.