brainpy.connect
module#
Base Connection Classes and Tools#
Set the default dtype. |
|
convert a dense matrix to (indices, indptr). |
|
Convert csr to csc. |
|
convert (indices, indptr) to a dense matrix. |
|
convert pre_ids, post_ids to (indices, indptr) when'jax_platform_name' = 'gpu' |
|
Convert csr to csc. |
|
convert (indices, indptr) to a dense matrix. |
|
convert (indices, indptr) to a dense connection number matrix. |
|
Convert boolean matrix to a dense connection number matrix. |
|
Visualize the matrix. |
|
Base Synaptic Connector Class. |
|
Synaptic connector to build connections between two neuron groups. |
|
Synaptic connector to build synapse connections within a population of neurons. |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
|
str(object='') -> str str(bytes_or_buffer[, encoding[, errors]]) -> str |
Custom Connections#
Connector built from the dense connection matrix. |
|
Connector built from the |
|
Connector built from the CSR sparse connection matrix. |
|
Connector built from the sparse connection matrix |
Random Connections#
Connect the post-synaptic neurons with fixed probability. |
|
Connect a fixed number pf pre-synaptic neurons for each post-synaptic neuron. |
|
Connect the fixed number of post-synaptic neurons for each pre-synaptic neuron. |
|
Connect the synaptic neurons with fixed total number. |
|
Builds a Gaussian connectivity pattern within a population of neurons, where the connection probability decay according to the gaussian function. |
|
Connection with a maximum distance under a probability p. |
|
Build a Watts–Strogatz small-world graph. |
|
Build a random graph according to the Barabási–Albert preferential attachment model. |
|
Build a random graph according to the dual Barabási–Albert preferential attachment model. |
|
Holme and Kim algorithm for growing graphs with powerlaw degree distribution and approximate average clustering. |
Regular Connections#
Connect two neuron groups one by one. |
|
Connect each neuron in first group to all neurons in the post-synaptic neuron groups. |
|
The nearest four neighbors connection method. |
|
The nearest eight neighbors conn method. |
|
The nearest (2*N+1) * (2*N+1) neighbors conn method. |
|
Connect two neuron groups one by one. |
|
Connect each neuron in first group to all neurons in the post-synaptic neuron groups. |
|
The nearest four neighbors connection method. |
|
The nearest eight neighbors conn method. |