| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6264528 | Brain Research | 2012 | 8 Pages |
We consider a random synaptic pruning in an initially highly interconnected network. It is proved that a random network can maintain a self-sustained activity level for some parameters. For such a set of parameters a pruning is constructed so that in the resulting network each neuron/node has almost equal numbers of in- and out-connections. It is also shown that the set of parameters which admits a self-sustained activity level is rather small within the whole space of possible parameters. It is pointed out here that the threshold of connectivity for an auto-associative memory in a Hopfield model on a random graph coincides with the threshold for the bootstrap percolation on the same random graph. It is argued that this coincidence reflects the relations between the auto-associative memory mechanism and the properties of the underlying random network structure.This article is part of a Special Issue entitled “Neural Coding".
⺠We model a pruning process to obtain a network with equal mean numbers of in- and out-connections. ⺠The constant speed of excitation is possible only on the critical line of parameters. ⺠The thresholds of connectivity for large storage capacity and for (bootstrap) percolation coincide.
